euclid (c. -300)nachum/talks/algorithm.pdf · the main problem of mathematical logic. •! the...
TRANSCRIPT
![Page 1: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/1.jpg)
Euclid (c. -300)
Euclid’s GCD algorithm appeared in his Elements. Formulated geometrically: Find common measure for 2 lines. Used repeated subtraction of the shorter segment from the longer.
![Page 2: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/2.jpg)
Gottfried Wilhelm Leibniz (1666)
The only way to rectify our reasonings is to make them as tangible as those of the Mathematician, so that we can find our error at a glance, and when there are disputes among persons, we can simply say: Let us calculate, without further ado, in order to see who is right.
![Page 3: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/3.jpg)
David Hilbert (c. 1900)
#2. Provide an effective method to determine if a formula is valid.
#2. Provide an effective method to determine if a formula is valid.
![Page 4: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/4.jpg)
Hilbert & Ackermann (1928)
•! The Entscheidungsproblem is solved when we know a procedure that allows for any given logical expression to decide by finitely many operations its validity or satisfiability.
•! The Entscheidungsproblem must be considered the main problem of mathematical logic.
•! The solution of the Entscheidungsproblem is of fundamental significance for the theory of all domains whose propositions could be developed on the basis of a finite number of axioms.
![Page 5: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/5.jpg)
Expansion
>
![Page 6: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/6.jpg)
State Transition
>
![Page 7: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/7.jpg)
Computation
![Page 8: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/8.jpg)
Computation
![Page 9: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/9.jpg)
Jules Henri Poincaré
We might imagine a machine where we should put in axioms at one end and take out theorems at the other, like that legendary machine in Chicago where pigs go in alive and come out transformed into hams and sausages.
![Page 10: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/10.jpg)
What is an algorithm?
Looking for a canonical notion of algorithm.
Looking for a canonical notion of an effective algorithm.
Looking for a canonical notion of an effective numeric algorithm.
![Page 11: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/11.jpg)
What is an algorithm?
Looking for a canonical notion of algorithm.
Looking for a canonical notion of an effective algorithm.
Looking for a canonical notion of an effective numeric algorithm.
![Page 12: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/12.jpg)
Don Knuth (1966)
Algorithms are concepts which have existence apart from any programming language… I believe algorithms were present long before Turing et al. formulated them, just as the concept of the number “two” was in existence long before the writers of first grade textbooks and other mathematical logicians gave it a certain precise definition.
![Page 13: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/13.jpg)
Church’s Thesis
![Page 14: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/14.jpg)
Church’s Thesis (1936)
Recursive functions “capture” effective computability.
![Page 15: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/15.jpg)
Richard Montague (1960)
Discussion of Church’s thesis has su!ered for lack of a precise
general framework within which it could be
conducted.
![Page 16: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/16.jpg)
Recursive Functions
•! Partial functions on natural numbers.
•! Initial functions 0 and successor.
•! Other functions defined via equations: x + 0 = x
x + y’ = (x + y)’
0 ! y = 0
x’ ! y = (x ! y)’
[Hilbert, Ackermann, Peter, Herbrand, Gödel]
![Page 17: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/17.jpg)
Kurt Gödel (1930s)
1 n=0 n!f(n-1) otherwise = { f(n)
![Page 18: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/18.jpg)
Alonzo Church
[We] propose a definition of effective calculability which is thought to correspond satisfactorily to [a] somewhat vague intuitive notion....
We now define ... the notion of effective calculable function of the positive integers by identifying it with the notion of a recursive function.
![Page 19: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/19.jpg)
Why Believe?
•! Experience: programming languages compute only recursive functions. –! But history is full of delayed discoveries.
•! Model equivalence: Church, Turing, Post, Markov, Kolmogorov. –! But what excludes a systematic error?
•! Turing’s analysis. This is by far the strongest argument that convinced even skeptical Gödel.
![Page 20: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/20.jpg)
Alan Turing (1936)
A man provided with paper, pencil, and
rubber, and subject to strict discipline, is in effect a universal
machine.
![Page 21: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/21.jpg)
Turing’s Thesis
Turing Machinescapturemechanicalhumancomputation.
![Page 22: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/22.jpg)
Alan Turing (1936)
A man provided with paper, pencil, andrubber, and subject to strict discipline,is in effect a universal machine.
The theorem that all effectivelycalculable sequences are computable andits converse are proved....
![Page 23: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/23.jpg)
Turing (1948)
Logical Computing Machines can doanything that could be described as“rule of thumb” or “purely mechanical”.This is sufficiently well established thatit is now agreed amongst logicians that“calculable by means of an LCM” is thecorrect rendering of such phrases.
![Page 24: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/24.jpg)
Turing’s Axioms
• Sequential symbol manipulation
• Finite internal states
• Linear external memory
• Finite symbol space
• Finite observability and local action
• Deterministic
![Page 25: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/25.jpg)
Finite Internal States
– If we admitted an infinity of statesof mind, some of them will be“arbitrarily close” and will beconfused
![Page 26: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/26.jpg)
Linear External Memory
– The two-dimensional character ofpaper is no essential of computation
![Page 27: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/27.jpg)
Finite Alphabet
– If we were to allow an infinity ofsymbols, then there would be symbolsdiffering to an arbitrary small extent
![Page 28: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/28.jpg)
Finiteness and Localness
– [Operations] so elementary that it isnot easy to imagine them furtherdivided
• Can only observe a finite number ofsymbols at each step
![Page 29: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/29.jpg)
Deterministic
– The behavior at any moment isdetermined by the symbols which heis observing and his “state of mind” atthe moment
![Page 30: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/30.jpg)
Kleene (1936)
So Turing’s and Church’s theses are equivalent. We shall usually refer to them both as Church’s thesis, or in connection with that one of its... versions which deals with “Turing machines” as the Church-Turing thesis.
![Page 31: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/31.jpg)
![Page 32: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/32.jpg)
The Turing Tarpit
•! Thue systems –! Post systems
•! Lambda calculi
•! Partial recursion
•! Turing machines
•! Markov normal algorithms
•! Minsky counter machines
•! Type 0 languages
•! Kolmogorov-Uspenskii machines
•! Neuring machines
•! Wang machines
•! Random access machines
•! Quantum computers
•! Billiard ball computers
•! Least fixpoints
•! Fortran, Algol, Lisp, C, Pascal, Logo, Ada, Java, ...
![Page 33: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/33.jpg)
Bernard Moret
The remarkable result about these varied models is that all of them define exactly the same class of computable functions: whatever one model can compute, all the others can too!
![Page 34: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/34.jpg)
Turing (1948)
Logical Computing Machines can do anything that could be described as “rule of thumb” or “purely mechanical”. This is sufficiently well established that it is now agreed amongst logicians that “calculable by means of an LCM” is the correct rendering of such phrases.
![Page 35: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/35.jpg)
Godel
•! It was only by Turing’s work that it became completely clear, that my proof is applicable to every formal system containing arithmetic.
•! I think the reader has a right to be informed about the present state of affairs.
![Page 36: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/36.jpg)
Church to Kleene (1935)
[Gödel thought] that it might be possible ... to state a set of axioms which would embody the generally accepted properties of [effective calculability], and to do something on that basis.
![Page 37: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/37.jpg)
Laszlo Kalmár (1959)
There are pre-mathematical concepts which must remain [so].... Among these belong ... such concepts as that of effective calculability ... the extension of which cannot cease to change during the development of mathematics.
32
![Page 38: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/38.jpg)
Joe Shoenfield (1991)
It may seem that it is impossible to give a proof of Church’s Thesis. However, this is not necessarily the case. We can write down some axioms about computable functions which most people would agree are evidently true. It might be possible to prove Church’s Thesis from such axioms.
However, despite strenuous efforts, no one has succeeded in doing this (although some in
teresting partial results have been obtained).
![Page 39: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/39.jpg)
Axiomatics
![Page 40: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/40.jpg)
Donald Knuth (1968)
A computational method consists of:
1.!States Q
2.!Input I " Q
3.!Output O " Q
4.!Transitions ! : Q # Q
In this way we can divorce abstract algorithms from particular programs that represent them.
![Page 41: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/41.jpg)
terminal
![Page 42: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/42.jpg)
Algorithm = Transition System
I
O
Q
![Page 43: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/43.jpg)
![Page 44: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/44.jpg)
I. Sequential Time
•! An algorithm is a state-transition system.
•! Its transitions are partial functions.
![Page 45: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/45.jpg)
![Page 46: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/46.jpg)
State encapsulates all relevant data!
![Page 47: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/47.jpg)
[a] [f] [a] [f]
![Page 48: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/48.jpg)
![Page 49: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/49.jpg)
Kleene
An algorithm in our sense must be fully and finitely described before any particular question to which it is applied is selected. When the question has been selected, all steps must then be predetermined and performable without any exercise of ingenuity or mathematical invention by the person doing the computing.
![Page 50: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/50.jpg)
C° C°
![Page 51: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/51.jpg)
II. Abstract State
•! States are (first-order) structures.
•! All states share the same (finite) vocabulary.
•! Transitions preserve the domain (base set) of states.
![Page 52: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/52.jpg)
Joe Shoenfield
A method must be mechanical…
Methods which involve chance procedures are excluded;… methods which involve magic are excluded;… methods which require insight are excluded.
![Page 53: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/53.jpg)
C°
C
C°
F° F°
![Page 54: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/54.jpg)
II. Abstract State
•! States are (first-order) structures.
•! All states share the same (finite) vocabulary.
•! Transitions preserve the domain (base set) of states.
•! States, initial states, and terminal states are closed under isomorphism.
•! Transitions and isomorphisms commute.
![Page 55: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/55.jpg)
Kolmogorov The mathematical notion of Algorithm has
to preserve two properties:
1. The computational operations are carried out in discrete steps, where every step only uses a bounded part of the results of all preceding operations.
2. The unboundedness of memory is only quantitative: i.e., we allow an unbounded number of elements to be accumulated, but they are drawn from a finite set of types, and the relations that connect them have limited complexity…
![Page 56: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/56.jpg)
Kolmogorov
It seems plausible to us that an arbitrary algorithmic process satisfies our definition of algorithms. We would like to emphasize that we are talking not about a reduction of an arbitrary algorithm to an algorithm in the sense of our definition, but that every algorithm essentially satisfies the proposed definition.
![Page 57: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/57.jpg)
![Page 58: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/58.jpg)
C
![Page 59: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/59.jpg)
III. Bounded Exploration
•! Transitions are determined by a fixed finite “glossary” of “critical” terms.
•! That is, there exists some finite set of (ground) terms over the vocabulary of the states, such that states that agree on the values of these glossary terms, also agree on all state changes.
![Page 60: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/60.jpg)
Bounded Exploration
•! Whenever X,Y coincide on T, ! (x)-x = ! (y)-y
x=3; f(3)=5; y=7
!
T = {x, f(x)}
x=1; f(3)=0; y=7
x=3; f(3)=5; y=2
! x=1; f(3)=0; y=2
x=3; f(3)=5; y=1
! x=1; f(3)=0; y=4
![Page 61: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/61.jpg)
ASM Theorem
Abstract state machines emulate any program satisfying these postulates.
![Page 62: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/62.jpg)
Ada Lovelace
Many persons who are not conversant with mathematical studies imagine that because the business of [the Analytical Engine] is to give its results in numerical notation, the nature of its processes must consequently be arithmetical and numerical rather than algebraical and analytical. This is an error. The engine can arrange and combine its numerical quantities exactly as if they were letters or any other general symbols; and in fact it might bring out its results in algebraical notation were provisions made accordingly.
![Page 63: Euclid (c. -300)nachum/talks/Algorithm.pdf · the main problem of mathematical logic. •! The solution of the Entscheidungsproblem is of ... is observing and his “state of mind”](https://reader033.vdocuments.mx/reader033/viewer/2022042621/5f651c614f82e802834b1982/html5/thumbnails/63.jpg)
The Analytical Engine does not occupy common ground with mere "calculating machines." … In enabling mechanism to combine together general symbols in successions of unlimited variety and extent, a uniting link is established between the operations of matter and the abstract mental processes of the most abstract branch of mathematical science.
A.A.L.