David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Philosophia Mathematica 6 (3):302-323 (1998)
This paper defends the traditional conception of Church's Thesis , as unprovable but true, against a group of arguments by Gandy, Mendelson, Shapiro and Sieg. The arguments here considered urge that CT is provable or proved. This paper argues, first, that contra-Mendelson, CT does connect a mathematically precise concept with an intuitive notion . Second, the various ‘proofs’ of CT fail to undermine the traditional conception of CT as unprovable. Either they do not conform to the sense of proof imbedded in the standard conception, or they prove something other than CT
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
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.
Citations of this work BETA
Gualtiero Piccinini (2011). The Physical Church–Turing Thesis: Modest or Bold? British Journal for the Philosophy of Science 62 (4):733 - 769.
Gualtiero Piccinini (2007). Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy. Synthese 154 (1):97-120.
Jörgen Sjögren (2010). A Note on the Relation Between Formal and Informal Proof. Acta Analytica 25 (4):447-458.
Similar books and articles
Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.
Oron Shagrir (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2):221-240.
Tim Button (2009). SAD Computers and Two Versions of the Church–Turing Thesis. British Journal for the Philosophy of Science 60 (4):765-792.
Wilfried Sieg (1997). Step by Recursive Step: Church's Analysis of Effective Calculability. Bulletin of Symbolic Logic 3 (2):154-180.
B. Jack Copeland (2008). The Church-Turing Thesis. In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. [REVIEW] Minds and Machines 18 (3):349-355.
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Carol E. Cleland (1993). Is the Church-Turing Thesis True? Minds and Machines 3 (3):283-312.
Robert Black (2000). Proving Church's Thesis. Philosophia Mathematica 8 (3):244--58.
Added to index2009-01-28
Total downloads17 ( #139,311 of 1,696,562 )
Recent downloads (6 months)1 ( #343,026 of 1,696,562 )
How can I increase my downloads?