| 
|
Quote: formal systems or formalisms are the same as Turing machines
topics >
all references >
references g-h >
Topic:
mathematics as a formal system
Topic:
Turing machine
Group:
formalism
Topic:
limitations of formalism
Topic:
Godel's incompleteness theorem
Quotation Skeleton
Note added 28 August 1963. In consequence of … [Turing 1937, p. 249] a precise and unquestionably adequate definition of the general notion … is now possible. That is, it can be … theory there exist undecidable arithmetic propositions and that … [footnote]: In my opinion the term "formal system" or "formalism" should … Google-1 Google-2
Copyright clearance needed for quotation.
Additional Titles
Quote: can not prove the consistency of any consistent formal system that contains a certain amount of number theory
Topic: mathematics as a formal system (30 items)
Topic: Turing machine (30 items)
Group: formalism (9 topics, 473 quotes)
Topic: limitations of formalism (92 items)
Topic: Godel's incompleteness theorem (19 items)