User:Ἀριστοτέλης
From Wikipedia, the free encyclopedia
Contents |
[edit] Why simulate human thought?
Humans are always making errors but logic, on the other hand, is a tool that can be used to eliminate human errors. Logic can help humans reach error free conclusions. The first conclusion I was inspired to reach was whether God existed or not. This interest began as a child when introduced to Jesus Christ in Seventh Day Adventist Vacation Bible School. Although I still have the plaster casts of a lion's head (but have since lost the other bible story castings) I vividly remember the two ladies who introduced me to Christ and the idea that Christ is the Son of God or as others proclaim is God. From this beginning many years ago I have questioned everything as to the existence of God although I have always believed in God but perhaps with a different comprehension than your own.
Less than ten years after being introduced to Christ I was introduced to the idea that computers were superior to man. I recall asking then what conclusion had computers reached about the existence of God. The answer I was told (and by a Presbyterian minister no less [BTW I was at that point attending Presbyterian church]) was that computers said they did not have enough information. (Hence the most likely reason for my current interest and participation in the Wikipedia.)
Within the next ten years what I actually came to realize is that in order for a computer to reach a conclusion as to the existence of God that a computer would have to be able to think like a human being so I began to search for a way to get a computer to do just that. I wanted to use Boolean algebra but the Soviets at the time were already well into the use of logic as the basis of their system. Then by chance I discovered a book on digital electronics entitled “Digital/Logic Electronics Handbook” by William L Hunter (Tab Books, Blue Ridge summit, PA) that described a method of reducing logical equations to minimum form. The method is called the Harvard Chart Method of logical equation reduction (pg 112-113). It was said that the method was suitable for reducing to minimum form equations with a number of variables greater than five and it appeared that the method could be computerized and could reduce to minimum form equations having an unlimited number of variables limited only by the capacity of the hardware on which it was run. But binary logic was not getting the Soviets anywhere and was actually making them sound like idiots so I concentrated on a way to convert the method to handle multiple states.
In less than a few weeks I was able to make the modification and began testing the capability of the program. One test involved assigning meaning to the multiple state symbolic variables. The meaning I decided to assign was "happiness" for the dependent variable and "love" and "money" as the meaning of two independent variables and then "none," "lots," and "some" as the states of each. Mind you this was a very rudimentary and limited test but was required due to the limited amount of memory (4K) and speed (4mhz) of the computer I had available at the time. (TRS-80 Model I).
I then asked several people to define happiness in terms of no, lots or some love and money, converted their definitions to multiple state logical equations and then applied the multiple state logical equation reduction program. Sure enough as the program spit out the results each person remarked that it was just like they had turned to a friend and said "I believe in such and such.." and their friend had replied "...oh you mean this and that." It was fascinating. The first artificial intelligence program based on multiple state logical equation reduction.
I published the computer program in 1981 and went on to other things.
But what about using the program to determine whether God existed or not? Hummm I had almost forgotten my original application. So beginning in about 1990 I began looking for hardware capable of scaling up the program. I went to Harvard and to MIT and to the University of Syracuse and to Florida State University before I was ever asked how much computer time and memory I would need. Since I had never really asked that question myself I sat down and determined that memory size for the multiple state Harvard Chart matrix would be equal to the number of bytes per logical state times the number of states per independent variable raised to the power of the number of independent variables raised to the power of two which as it turns out would limit me to only 32 variables and 32 states on the largest machine then available to me.
It appeared that I had reached another plateau and the idea sat on the shelf again until 1996. One day in 1996 I decided to look at the program again and all of the sudden it hit me. I already had the answer! There would never be a computer or person capable of reducing an infinite number of logical equations having an infinite number of variables and an infinite number of states to minimum form instantaneously and as a matter of fact only God fit that definition. Only God is capable of reducing an infinite number of logical equations having an infinite number of variables and an infinite number of states to minimum form instantaneously by definition. The idea that there might be such a situation is sort of like the "something" that can replace a vacuum in the idea that nature abhors a vacuum. Some entity must be able to do it and the logical entity is God. There is therefore no logical barrier to having faith in God as the Supreme Ruler of the Universe. I have accepted despite arguments to the contrary that Jesus Christ is God.
[edit] Harvard Basic v11
The following program written in Microsoft Visual Basic v6 will reduce multiple state logical equations to minimum form and may be used to simulate logical human thought. (Logical human thought is defined in this case as the process of reducing a multiple state logical equation to minimum form.)
Sub MAIN() 100 '--- HARVARD CHART METHOD OF LOGICAL EQUATION REDUCTION 110 '--- Multiple State version 120 '--- by Patrick C. Eberhart © 1968-2008 130 '------------------------------------------------------------------------- 140 '-------- dimension array to hold raw terms -------------- 150 Dim ai$(20) 160 '-------- skip symbolic processing ---------------------- 170 k = 0 180 v = 0 190 i = 0 200 '-------- open truth table file ---------------------- 210 '--- table composed of alphanumeric variables in raw format ----- 220 Open "c:/multiplestates.txt" For Input As #1 230 Do While Not EOF(1) 240 Input #1, ai$(i) 250 If ai$(i) = "" Then Exit Do 260 Debug.Print i, ai$(i); Len(ai$(i)) 270 i = i + 1 280 Loop 290 Close #1 300 '------ convert string input to numeric --- 310 b = i 320 g = b - 1 330 i = 0 340 Do Until ai$(i) = "" 350 If i > 0 And Len(ai$(i)) <> k Then End 360 k = Len(ai$(i)) 370 For j = 1 To k 380 o$ = Mid$(ai$(i), j, 1): r = Val(o$) 390 If r > v Then v = r 400 Next 410 Debug.Print i; "==>"; ai$(i); b; k; v 420 i = i + 1 430 Loop 440 b = i 450 v = v + 1 460 '---- GENerate chart ------------ 470 Dim xi$(10) 480 Dim ah(10), bi$(111, 111), Q(1111) 490 For i = 0 To v - 1 500 xi$(i) = Right$(Str$(i), Len(Str$(i)) - 1) 510 Next i 520 For i = 1 To v ^ k: Q(i) = 0: For j = 1 To v ^ k: bi$(i, j) = String$(k, 32): Next j, i 530 For i = 1 To v ^ k: T = i - 1 540 For j = k To 1 Step -1 550 D = Int(T / v): ah(j) = T - D * v: T = D: Next j 560 For l = 1 To v ^ k: F = l - 1 570 For j = 1 To k 580 D = Int(F / v): E = F - D * v: F = D 590 If E = 0 Then GoTo ISZERO 600 Mid$(bi$(i, l), j, 1) = xi$(ah(j)) 610 For M = 0 To g: If ai$(M) = bi$(i, l) Then Q(i) = 1 620 Next M 630 ISZERO: 640 Next j 650 Next l 660 Next i 670 S$ = String$(k, 88) 680 '--------reduce chart--------- 690 For j = 1 To v ^ k 700 For i = 1 To v ^ k 710 If Q(i) = 1 Then GoTo IGNORE 720 For N = 1 To v ^ k 730 If bi$(i, j) = bi$(N, j) And Q(N) = 1 Then bi$(N, j) = S$ 740 Next N 750 If Q(i) = 0 Then bi$(i, j) = S$ 760 IGNORE: 770 Next i 780 For i = 1 To v ^ k 790 For l = j + 1 To v ^ k 800 For M = 1 To k 810 WERT$ = Mid$(bi$(i, l), M, 1) 820 WART$ = Mid$(bi$(i, j), M, 1) 830 If WERT$ = WART$ Then bi$(i, l) = S$ 840 Next M 850 Next l 860 Next i 870 Next j 880 '------CONVERT chart ---------- 890 For j = 1 To v ^ k: For i = 1 To v ^ k 900 If bi$(i, j) <> S$ And InStr(1, p$, bi$(i, j)) = 0 Then p$ = p$ + bi$(i, j) + "+" 910 Next i, j 920 For j = 1 To Len(p$): x = x + 1 930 Tag$ = Mid$(p$, j, 1): If Tag$ = "+" Then xr$ = xr$ + "+": x = 0: GoTo ORTAG 940 xr$ = xr$ + Tag$: If Tag$ <> " " Then xr$ = xr$ + Chr$(64 + x) 950 ORTAG: 960 Next j 970 Debug.Print Chr$(65 + k); " = "; Left$(xr$, Len(xr$) - 1) 980 ' Stop 990 End End Sub
[edit] User definition of happiness
| y/n | Love | Money |
|---|---|---|
| n | no | no |
| n | no | lots |
| n | no | some |
| y | lots | no |
| y | lots | lots |
| y | lots | some |
| y | some | no |
| y | some | lots |
| y | some | some |
[edit] multiplestates.txt contents
10 20 11 12 21 22
[edit] Program Results
C = 1A + 2A
[edit] Results Interpretation
Happiness is lots of love or some love.
[edit] Other work
[edit] PatShaw Web page
On Sunday, January 01, 2006, 10:40:56 PM I created the following HTML document, chicken.htm (last updated on Wednesday, October 28, 1998, 7:39:50 PM), on my GTE user site named PatShaw using Microsoft Publisher 97. In the course of changing physical locations and GTE phone numbers and accounts over time the particular account no longer exists but records of its existence may be found through Verizon which I was told had created permanent records.
I was introduced to the question of the Chicken and the egg by a security guard in about 1981 at the airport post office parking area when I went to mail a letter. I have no idea how the question came up or why he posed the question but the effect on me was the challenge to find the answer. My effort resulted in the initial posting of the following in January, 1996.
Please enjoy:
THE CHICKEN OR THE EGG
Which Came First?
While the question, "Which came first, the chicken or the egg?" frames the construct
of a dilemma it also frames the beliefs of anyone quick enough to respond.
To defend their respective beliefs evolutionists, creationists and protagonists have conjured up
answers which leave no neutral ground on which a neophyte might stand.
Unfortunately none believe that a chicken comes from the egg which it lays.
Because eggs in general are produced by a variety of fowl and other varmint
(including the evolutionist's "pre-chicken"), the evolutionist argues that the egg
is not dependent upon a chicken and conversely that a chicken gets here
by no other means - with a single exception, of course.
(see Exception Theory<a href="/patshaw/exception.htm" target="content">Exception Theory</a>)
The evolutionist believes that the original chicken came from a "pre-chicken" by means of
a mutated egg. Had the egg not been mutated it would have produced a "pre-chicken."
The mutation of the egg was independent of the "pre-chicken" and left the "pre-chicken" herself unchanged.
Other interesting points to ponder:
1) If we name the egg after the entity it produces then the name of the entity
comes before the name of the egg.
2) Before any egg is hatched we call it by the name of the entity that laid it.
2.1) If the egg is hatched by a different entity than the one that laid it
then we call that entity a surrogate. (Rhymes with Watergate.)
3) Although it is proper to wait until an egg is laid before calling it by the name of its occupant
we may call it by that name if we can determine who the occupant is before the egg is hatched.
For an evolutionist the egg comes before the chicken but for a creationist
(who believes that God created man before He created Women),
the egg has no chance of getting here first.
While the evolutionist's and the creationist's points of view are highly reflective
none can rival the view of the protagonist. For the protagonist only one answer can prevail:
Neither the chicken or the egg came first but rather it was the rooster.
The real dilemma? How to avoid answering this question altogether so as not to be labeled as either one.
Copyright 1996 © Patrick Eberhart
Further clarification: The chicken is the mutated offspring of the pre-chicken rather than the mutated pre-chicken itself because the mutation occurred in the pre-chicken after the pre-chicken was named. (...or did I say that?)
[edit] Exception Theory
No doubt you have heard that for every rule there is an exception. Exception theory expands upon this premise to say that for every exception there is an exception... ad infinitum. (That's Latin for a long time!)
Take the rule that black is black. When describing visual color this rule might be true without exception (an exception to the rule that "for every rule there is an exception")
However, black might refer to race instead of to visual color and Blacks may retain many or few characteristics of black culture.
Again there may be exceptions. Exception theory can be stated in another way:
For every rule not all relevant variables or states may have been determined.
[edit] Check sort and Rapid sort
[edit] Optimal classification
The reduction in the number of queries which must be made to identify an organism or an action is helpful to the speed of identification both for humans and computers. reduces the number of queries which have to be made. I wrote the Optimal classification article for this reason under the name of Julie Dancer to keep it distinct and separate from other works and in thanks Dr. Eugene Weston Rypka for publishing his work.
[edit] Instructables
Currently as a hobby I am writing projects on the Instructables web site under various member names.
My current favorite project is An emergency pocket stove.
[edit] Half-Life_Computation
This project resulted from an argument which was not resolved until it was realized that more than one kind of half life computation exists.
