Minds and Machines 18 (3):349-355 (2008)

Eli Dresner
Tel Aviv University
In recent years it has been convincingly argued that the Church-Turing thesis concerns the bounds of human computability: The thesis was presented and justified as formally delineating the class of functions that can be computed by a human carrying out an algorithm. Thus the Thesis needs to be distinguished from the so-called Physical Church-Turing thesis, according to which all physically computable functions are Turing computable. The latter is often claimed to be false, or, if true, contingently so. On all accounts, though, thesis M is not easy to give counterexamples to, but it is never asked why—how come that a thesis that transfers a notion from the strictly human domain to the general physical domain just happens to be so difficult to falsify. In this paper I articulate this question and consider several tentative answers to it.
Keywords Church-Turing thesis   Computability   Physical computability   Thesis M   Turing
Categories (categorize this paper)
DOI 10.1007/s11023-008-9104-8
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: 68,916
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.
Radical Interpretation.Donald Davidson - 1973 - Dialectica 27 (1):314-328.

View all 18 references / Add more references

Citations of this work BETA

The Philosophy of Computer Science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Is the Church-Turing Thesis True?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
Quantum Speed-Up of Computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.


Added to PP index

Total views
72 ( #157,995 of 2,497,981 )

Recent downloads (6 months)
1 ( #428,301 of 2,497,981 )

How can I increase my downloads?


My notes