Deviant encodings and Turing's analysis of computability

Turing’s analysis of computability has recently been challenged; it is claimed that it is circular to analyse the intuitive concept of numerical computability in terms of the Turing machine. This claim threatens the view, canonical in mathematics and cognitive science, that the concept of a systematic procedure or algorithm is to be explicated by reference to the capacities of Turing machines. We defend Turing’s analysis against the challenge of ‘deviant encodings’.Keywords: Systematic procedure; Turing machine; Church–Turing thesis; Deviant encoding; Acceptable encoding; Turing’s analysis of computability; Turing’s Notational Thesis
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.shpsa.2010.07.010
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,938
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
Alan Turing (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1):230-265.
B. Jack Copeland (2008). The Church-Turing Thesis. In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University
Wilfried Sieg (1994). Mechanical Procedures and Mathematical Experience. In Alexander George (ed.), Mathematics and Mind. Oxford University Press 71--117.

View all 8 references / Add more references

Citations of this work BETA
Dale Jacquette (2014). Computable Diagonalizations and Turing's Cardinality Paradox. Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
Michael Rescorla (2012). Copeland and Proudfoot on Computability. Studies in History and Philosophy of Science Part A 43 (1):199-202.

Add more citations

Similar books and articles
Michael Rescorla (2012). Copeland and Proudfoot on Computability. Studies in History and Philosophy of Science Part A 43 (1):199-202.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Jack Copeland (1999). Beyond the Universal Turing Machine. Australasian Journal of Philosophy 77 (1):46-67.
W. Sieg (2006). Godel on Computability. Philosophia Mathematica 14 (2):189-207.

Monthly downloads

Added to index


Total downloads

28 ( #109,559 of 1,725,631 )

Recent downloads (6 months)

3 ( #211,030 of 1,725,631 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.