On some recent criticism of Church's Thesis
Notre Dame Journal of Formal Logic 4 (3):201-205 (1963)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
|
| Through your library | Configure |
B. Jack Copeland (2008). The Church-Turing Thesis. In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Tim Button (2009). Sad Computers and Two Versions of the Church–Turing Thesis. British Journal for the Philosophy of Science 60 (4):765-792.
Robert Black (2000). Proving Church's Thesis. Philosophia Mathematica 8 (3):244--58.
Gualtiero Piccinini (2007). Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy. Synthese 154 (1):97-120.
Elliott Mendelson (1990). Second Thoughts About Church's Thesis and Mathematical Proofs. Journal of Philosophy 87 (5):225-233.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. Minds and Machines 18 (3).
Carol Cleland (2006). The Church-Turing Thesis: A Last Vestige of a Failed Mathematical Program. In A. Olszewski, J. Wole'nski & R. Janusz (eds.), Church's Thesis After Seventy Years. Ontos Verlag.
Selmer Bringsjord & Konstantine Arkoudas (2006). On the Provability, Veracity, and AI-Relevance of the Church-Turing Thesis. In A. Olszewski, J. Wole'nski & R. Janusz (eds.), Church's Thesis After Seventy Years. Ontos Verlag.
Paolo Cotogno (2003). Hypercomputation and the Physical Church-Turing Thesis. British Journal for the Philosophy of Science 54 (2):181-223.
Janet Folina (1998). Church's Thesis: Prelude to a Proof. Philosophia Mathematica 6 (3):302-323.
John T. Kearns (1997). Thinking Machines: Some Fundamental Confusions. Minds and Machines 7 (2):269-87.
Saul A. Kripke (forthcoming). Another Approach: The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem. In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Gödel, Turing, Church, and beyond. MIT Press.
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Wilfried Sieg (1997). Step by Recursive Step: Church's Analysis of Effective Calculability. Bulletin of Symbolic Logic 3 (2):154-180.
Monthly downloads |
Added to index2010-08-24Total downloads5 ( #161,910 of 556,807 )Recent downloads (6 months)1 ( #64,847 of 556,807 )How can I increase my downloads? |

