Turing's Fallacies

Timm Lampert
Humboldt-University, Berlin
This paper reveals two fallacies in Turing's undecidability proof of first-order logic (FOL), namely, (i) an 'extensional fallacy': from the fact that a sentence is an instance of a provable FOL formula, it is inferred that a meaningful sentence is proven, and (ii) a 'fallacy of substitution': from the fact that a sentence is an instance of a provable FOL formula, it is inferred that a true sentence is proven. The first fallacy erroneously suggests that Turing's proof of the non-existence of a circle-free machine that decides whether an arbitrary machine is circular proves a significant proposition. The second fallacy suggests that FOL is undecidable.
Keywords Turing  Church-Turing Theorem  undecidability proof  Wittgenstein
Categories (categorize this paper)
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 38,035
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Alan Turing and the Mathematical Objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Undecidability in the Imitation Game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
A Note on the Theorems of Church‐Turing and Trachtenbrot.Michael Deutsch - 1994 - Mathematical Logic Quarterly 40 (3):422-424.
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Deviant Encodings and Turing’s Analysis of Computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.
Turing Cones and Set Theory of the Reals.Benedikt Löwe - 2001 - Archive for Mathematical Logic 40 (8):651-664.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
What Turing Did After He Invented the Universal Turing Machine.B. Jack Copeland & Diane Proudfoot - 2000 - Journal of Logic, Language and Information 9 (4):491-509.
Infinite Time Turing Machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.


Added to PP index

Total views
20 ( #329,325 of 2,312,725 )

Recent downloads (6 months)
3 ( #243,631 of 2,312,725 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature