Authors
Diane Proudfoot
University of Canterbury
Abstract
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
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,577
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

On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Acceptable Notation.Stewart Shapiro - 1982 - Notre Dame Journal of Formal Logic 23 (1):14-20.

View all 6 references / Add more references

Citations of this work BETA

The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
Copeland and Proudfoot on Computability.Michael Rescorla - 2012 - Studies in History and Philosophy of Science Part A 43 (1):199-202.
Implicit and Explicit Examples of the Phenomenon of Deviant Encodings.Paula Quinon - 2020 - Studies in Logic, Grammar and Rhetoric 63 (1):53-67.

View all 7 citations / Add more citations

Similar books and articles

Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Alan Turing and the Foundations of Computable Analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Infinite Time Turing Machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.
Omnibus Review. [REVIEW]John Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.
[Omnibus Review].John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.

Analytics

Added to PP index
2010-09-14

Total views
60 ( #176,602 of 2,446,559 )

Recent downloads (6 months)
1 ( #456,659 of 2,446,559 )

How can I increase my downloads?

Downloads

My notes