Church–Turing thesis (English Wikipedia)

Soare, Robert I. (2009-09-01). "Turing oracle machines, online computing, and three displacements in computability theory". Annals of Pure and Applied Logic. Computation and Logic in the Real World: CiE 2007. 160 (3): 368–399. doi:10.1016/j.apal.2009.01.008. ISSN 0168-0072.
Conrad, Michael (May 1985). "On design principles for a molecular computer". Communications of the ACM. 28 (5): 464–480. doi:10.1145/3532.3533.
Soare, Robert I. (September 1996). "Computability and Recursion". Bulletin of Symbolic Logic. 2 (3): 284–321. CiteSeerX 10.1.1.35.5803. doi:10.2307/420992. JSTOR 420992. S2CID 5894394.
Church 1936a Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27.
Kleene 1936 Kleene, Stephen Cole (1936). "Lambda-Definability and Recursiveness". Duke Mathematical Journal. 2 (2): 340–353. doi:10.1215/s0012-7094-36-00227-2.
Turing 1937a Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)
Kleene 1936 Kleene, Stephen Cole (1936). "Lambda-Definability and Recursiveness". Duke Mathematical Journal. 2 (2): 340–353. doi:10.1215/s0012-7094-36-00227-2.
Turing 1937b. Proof outline on p. 153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[10] $\lambda {\mbox{-definable}}$ Turing, Alan Mathison (December 1937b). "Computability and λ-Definability" (PDF). Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Archived from the original (PDF) on 2020-08-09.
Rosser 1939 in Davis 1965:225. Rosser, J. B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". The Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059. JSTOR 2269059. S2CID 39499392. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Footnote 3 in Church 1936a An Unsolvable Problem of Elementary Number Theory, in Davis 1965:89. Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
For a detailed discussion of Gödel's adoption of Turing's machines as models of computation, see Shagrir, Oron (2006-06-15). "Gödel on Turing on Computability" (PDF). Church's Thesis After 70 Years. De Gruyter. pp. 393–419. doi:10.1515/9783110325461.393. ISBN 978-3-11-032494-5. Archived from the original (PDF) on 2015-12-17. Retrieved 2016-02-08.
Turing 1937a. Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)
Church 1937. Church, Alonzo (March 1937). "Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem". Journal of Symbolic Logic. 2 (1): 42–43. doi:10.2307/2268810. JSTOR 2268810.
Italics added, Rosser 1939 in Davis 1965:226. Rosser, J. B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". The Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059. JSTOR 2269059. S2CID 39499392. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Kleene 1943, p. 60 in Davis 1965:274. Footnotes omitted. Kleene, Stephen Cole (1943). "Recursive Predicates and Quantifiers". Transactions of the American Mathematical Society. 53 (1): 41–73. doi:10.2307/1990131. JSTOR 1990131. Reprinted in The Undecidable, p. 255ff. Kleene refined his definition of "general recursion" and proceeded in his chapter "12. Algorithmic theories" to posit "Thesis I" (p. 274); he would later repeat this thesis (in Kleene 1952:300) and name it "Church's Thesis" (Kleene 1952:317) (i.e., the Church thesis). Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Piccinini, Gualtiero (January 2007). "Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy" (PDF). Synthese. 154 (1): 97–120. CiteSeerX 10.1.1.360.9796. doi:10.1007/s11229-005-0194-z. S2CID 494161. Archived (PDF) from the original on 2008-04-24.
Abramson, Darren (2011). "Philosophy of mind is (in part) philosophy of computer science". Minds and Machines. 21 (2): 203–219. doi:10.1007/s11023-011-9236-0. S2CID 32116031.

eatcs.org (Global: low place; English: low place)

Eberbach & Wegner 2003, p. 287. Eberbach, E.; Wegner, P. (October 2003). "Beyond Turing Machines" (PDF). Bulletin of the European Association for Theoretical Computer Science (81): 279–304. CiteSeerX 10.1.1.61.9759. Archived (PDF) from the original on 2016-03-15.

elsevier.com (Global: 610^th place; English: 704^th place)

linkinghub.elsevier.com

Soare, Robert I. (2009-09-01). "Turing oracle machines, online computing, and three displacements in computability theory". Annals of Pure and Applied Logic. Computation and Logic in the Real World: CiE 2007. 160 (3): 368–399. doi:10.1016/j.apal.2009.01.008. ISSN 0168-0072.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Turing 1937a Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)
Turing 1937a. Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)

huji.ac.il (Global: 3,903^rd place; English: 3,632^nd place)

moon.cc.huji.ac.il

For a detailed discussion of Gödel's adoption of Turing's machines as models of computation, see Shagrir, Oron (2006-06-15). "Gödel on Turing on Computability" (PDF). Church's Thesis After 70 Years. De Gruyter. pp. 393–419. doi:10.1515/9783110325461.393. ISBN 978-3-11-032494-5. Archived from the original (PDF) on 2015-12-17. Retrieved 2016-02-08.

jstor.org (Global: 26^th place; English: 20^th place)

Soare, Robert I. (September 1996). "Computability and Recursion". Bulletin of Symbolic Logic. 2 (3): 284–321. CiteSeerX 10.1.1.35.5803. doi:10.2307/420992. JSTOR 420992. S2CID 5894394.
Church 1936a Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27.
Turing 1937b. Proof outline on p. 153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[10] $\lambda {\mbox{-definable}}$ Turing, Alan Mathison (December 1937b). "Computability and λ-Definability" (PDF). Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Archived from the original (PDF) on 2020-08-09.
Rosser 1939 in Davis 1965:225. Rosser, J. B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". The Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059. JSTOR 2269059. S2CID 39499392. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Footnote 3 in Church 1936a An Unsolvable Problem of Elementary Number Theory, in Davis 1965:89. Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Church 1937. Church, Alonzo (March 1937). "Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem". Journal of Symbolic Logic. 2 (1): 42–43. doi:10.2307/2268810. JSTOR 2268810.
Italics added, Rosser 1939 in Davis 1965:226. Rosser, J. B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". The Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059. JSTOR 2269059. S2CID 39499392. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Kleene 1943, p. 60 in Davis 1965:274. Footnotes omitted. Kleene, Stephen Cole (1943). "Recursive Predicates and Quantifiers". Transactions of the American Mathematical Society. 53 (1): 41–73. doi:10.2307/1990131. JSTOR 1990131. Reprinted in The Undecidable, p. 255ff. Kleene refined his definition of "general recursion" and proceeded in his chapter "12. Algorithmic theories" to posit "Thesis I" (p. 274); he would later repeat this thesis (in Kleene 1952:300) and name it "Church's Thesis" (Kleene 1952:317) (i.e., the Church thesis). Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.

logicmatters.net (Global: low place; English: low place)

In his review of Church's Thesis after 70 Years edited by Adam Olszewski et al. 2006, Peter Smith's criticism of a paper by Muraswski and Wolenski suggests 4 "lines" re the status of the Church–Turing Thesis: (1) empirical hypothesis, (2) axiom or theorem, (3) definition, (4) explication. But Smith opines that (4) is indistinguishable from (3). Smith, Peter (2007-07-11). "Church's Thesis after 70 Years" (PDF). Logic Matters.
A collection of papers can be found in Olszewski, Woleński & Janusz (2006). Also a review of this collection: Smith, Peter (2007-07-11). "Church's Thesis after 70 Years" (PDF). Olszewski, Adam; Woleński, Jan; Janusz, Robert, eds. (2006). Church's Thesis After 70 Years. Frankfurt: Ontos. ISBN 978-3-938793-09-1. OCLC 909679288.

merriam-webster.com (Global: 209^th place; English: 191^st place)

See also "effective". Merriam-Webster's Online Dictionary (11th ed.). Retrieved 2014-07-26, which also gives these definitions for "effective" – the first ["producing a decided, decisive, or desired effect"] as the definition for sense "1a" of the word "effective", and the second ["capable of producing a result"] as part of the "Synonym Discussion of EFFECTIVE" there, (in the introductory part, where it summarizes the similarities between the meanings of the words "effective", "effectual", "efficient", and "efficacious").

ox.ac.uk (Global: 613^th place; English: 456^th place)

comlab.ox.ac.uk

Turing 1937a Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)
Turing 1937a. Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)

princeton.edu (Global: 741^st place; English: 577^th place)

findingaids.princeton.edu

Correspondence between Max Newman and Church in Alonzo Church papers

webspace.princeton.edu

Turing, A. M. (1938). Systems of Logic Based on Ordinals (PDF) (PhD). Princeton University. p. 8. Archived from the original (PDF) on 2012-10-23. Retrieved 2012-06-23.

cs.princeton.edu

Arora, Sanjeev; Barak, Boaz (2009). Complexity Theory: A Modern Approach. Cambridge University Press. ISBN 978-0-521-42426-4. Sections 1.4, "Machines as strings and the universal Turing machine" and 1.7, "Proof of theorem 1.9".

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Soare, Robert I. (September 1996). "Computability and Recursion". Bulletin of Symbolic Logic. 2 (3): 284–321. CiteSeerX 10.1.1.35.5803. doi:10.2307/420992. JSTOR 420992. S2CID 5894394.
Piccinini, Gualtiero (January 2007). "Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy" (PDF). Synthese. 154 (1): 97–120. CiteSeerX 10.1.1.360.9796. doi:10.1007/s11229-005-0194-z. S2CID 494161. Archived (PDF) from the original on 2008-04-24.
Eberbach & Wegner 2003, p. 287. Eberbach, E.; Wegner, P. (October 2003). "Beyond Turing Machines" (PDF). Bulletin of the European Association for Theoretical Computer Science (81): 279–304. CiteSeerX 10.1.1.61.9759. Archived (PDF) from the original on 2016-03-15.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Soare, Robert I. (September 1996). "Computability and Recursion". Bulletin of Symbolic Logic. 2 (3): 284–321. CiteSeerX 10.1.1.35.5803. doi:10.2307/420992. JSTOR 420992. S2CID 5894394.
Church 1936a Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27.
Turing 1937a Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)
Turing 1937b. Proof outline on p. 153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[10] $\lambda {\mbox{-definable}}$ Turing, Alan Mathison (December 1937b). "Computability and λ-Definability" (PDF). Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Archived from the original (PDF) on 2020-08-09.
Rosser 1939 in Davis 1965:225. Rosser, J. B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". The Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059. JSTOR 2269059. S2CID 39499392. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Footnote 3 in Church 1936a An Unsolvable Problem of Elementary Number Theory, in Davis 1965:89. Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Turing 1937a. Turing, A. M. (1937a) [Delivered to the Society November 1936], "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42, pp. 230–265, Bibcode:1937PLMS...42..230T, doi:10.1112/plms/s2-42.1.230, S2CID 73712 and Turing, A. M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2. Vol. 43 (published 1937). pp. 544–546. doi:10.1112/plms/s2-43.6.544. (See also: Davis 1965:115ff.)
Italics added, Rosser 1939 in Davis 1965:226. Rosser, J. B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". The Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059. JSTOR 2269059. S2CID 39499392. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
Piccinini, Gualtiero (January 2007). "Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy" (PDF). Synthese. 154 (1): 97–120. CiteSeerX 10.1.1.360.9796. doi:10.1007/s11229-005-0194-z. S2CID 494161. Archived (PDF) from the original on 2008-04-24.
Abramson, Darren (2011). "Philosophy of mind is (in part) philosophy of computer science". Minds and Machines. 21 (2): 203–219. doi:10.1007/s11023-011-9236-0. S2CID 32116031.

pdfs.semanticscholar.org

Church 1936a Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27.
Turing 1937b. Proof outline on p. 153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[10] $\lambda {\mbox{-definable}}$ Turing, Alan Mathison (December 1937b). "Computability and λ-Definability" (PDF). Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Archived from the original (PDF) on 2020-08-09.
Footnote 3 in Church 1936a An Unsolvable Problem of Elementary Number Theory, in Davis 1965:89. Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.

stanford.edu (Global: 179^th place; English: 183^rd place)

plato.stanford.edu

Copeland, B. Jack (2024), "The Church-Turing Thesis", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Winter 2024 ed.), Metaphysics Research Lab, Stanford University, retrieved 2025-06-11
Copeland, B. Jack (2017-11-10). "The Church-Turing Thesis". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy. ISSN 1095-5054. OCLC 429049174.

turing.org.uk (Global: low place; English: low place)

See also Hodges, Andrew (2005). "Did Church and Turing Have a Thesis about Machines?" (PDF). Archived from the original (PDF) on 2016-03-04. Retrieved 2014-07-27.

umsl.edu (Global: 8,618^th place; English: 7,478^th place)

Piccinini, Gualtiero (January 2007). "Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy" (PDF). Synthese. 154 (1): 97–120. CiteSeerX 10.1.1.360.9796. doi:10.1007/s11229-005-0194-z. S2CID 494161. Archived (PDF) from the original on 2008-04-24.

web.archive.org (Global: 1^st place; English: 1^st place)

Church 1936a Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27.
Turing 1937b. Proof outline on p. 153: $\lambda {\mbox{-definable}}$ ${\stackrel {triv}{\implies }}$ $\lambda {\mbox{-}}K{\mbox{-definable}}$ ${\stackrel {160}{\implies }}$ ${\mbox{Turing computable}}$ ${\stackrel {161}{\implies }}$ $\mu {\mbox{-recursive}}$ ${\stackrel {Kleene}{\implies }}$ ^[10] $\lambda {\mbox{-definable}}$ Turing, Alan Mathison (December 1937b). "Computability and λ-Definability" (PDF). Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046. Archived from the original (PDF) on 2020-08-09.
Turing, A. M. (1938). Systems of Logic Based on Ordinals (PDF) (PhD). Princeton University. p. 8. Archived from the original (PDF) on 2012-10-23. Retrieved 2012-06-23.
Footnote 3 in Church 1936a An Unsolvable Problem of Elementary Number Theory, in Davis 1965:89. Church, Alonzo (April 1936a). "An Unsolvable Problem of Elementary Number Theory" (PDF). American Journal of Mathematics. 58 (2): 345–363. doi:10.2307/2371045. JSTOR 2371045. S2CID 14181275. Archived from the original (PDF) on 2020-02-27. Davis, Martin, ed. (1965). The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions. New York: Raven Press. Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
For a detailed discussion of Gödel's adoption of Turing's machines as models of computation, see Shagrir, Oron (2006-06-15). "Gödel on Turing on Computability" (PDF). Church's Thesis After 70 Years. De Gruyter. pp. 393–419. doi:10.1515/9783110325461.393. ISBN 978-3-11-032494-5. Archived from the original (PDF) on 2015-12-17. Retrieved 2016-02-08.
See also Hodges, Andrew (2005). "Did Church and Turing Have a Thesis about Machines?" (PDF). Archived from the original (PDF) on 2016-03-04. Retrieved 2014-07-27.
Piccinini, Gualtiero (January 2007). "Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy" (PDF). Synthese. 154 (1): 97–120. CiteSeerX 10.1.1.360.9796. doi:10.1007/s11229-005-0194-z. S2CID 494161. Archived (PDF) from the original on 2008-04-24.
"Official Problem Description" (PDF). Archived from the original (PDF) on 2005-11-24.
Eberbach & Wegner 2003, p. 287. Eberbach, E.; Wegner, P. (October 2003). "Beyond Turing Machines" (PDF). Bulletin of the European Association for Theoretical Computer Science (81): 279–304. CiteSeerX 10.1.1.61.9759. Archived (PDF) from the original on 2016-03-15.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Soare, Robert I. (2009-09-01). "Turing oracle machines, online computing, and three displacements in computability theory". Annals of Pure and Applied Logic. Computation and Logic in the Real World: CiE 2007. 160 (3): 368–399. doi:10.1016/j.apal.2009.01.008. ISSN 0168-0072.
Kleene 1952:300. Kleene, Stephen Cole (1952). Introduction to Metamathematics. North-Holland. OCLC 523942.
Kleene 1952:376. Kleene, Stephen Cole (1952). Introduction to Metamathematics. North-Holland. OCLC 523942.
Kleene 1952:382, 536 Kleene, Stephen Cole (1952). Introduction to Metamathematics. North-Holland. OCLC 523942.
A collection of papers can be found in Olszewski, Woleński & Janusz (2006). Also a review of this collection: Smith, Peter (2007-07-11). "Church's Thesis after 70 Years" (PDF). Olszewski, Adam; Woleński, Jan; Janusz, Robert, eds. (2006). Church's Thesis After 70 Years. Frankfurt: Ontos. ISBN 978-3-938793-09-1. OCLC 909679288.
Gödel, Kurt (1995) [193?]. "Undecidable Diophantine Propositions". In Feferman, Solomon (ed.). Collected Works. Vol. 3. New York: Oxford University Press. p. 168. ISBN 978-0-19-507255-6. OCLC 928791907.
Horsten in Olszewski, Woleński & Janusz 2006:256. Olszewski, Adam; Woleński, Jan; Janusz, Robert, eds. (2006). Church's Thesis After 70 Years. Frankfurt: Ontos. ISBN 978-3-938793-09-1. OCLC 909679288.
Copeland, B. Jack (2017-11-10). "The Church-Turing Thesis". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy. ISSN 1095-5054. OCLC 429049174.
For a good place to encounter original papers see Chalmers, David J., ed. (2002). Philosophy of Mind: Classical and Contemporary Readings. New York: Oxford University Press. ISBN 978-0-19-514581-6. OCLC 610918145.
cf. Penrose, Roger (1990). "Algorithms and Turing machines". The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford: Oxford University Press. pp. 47–49. ISBN 978-0-19-851973-7. OCLC 456785846.
Also the description of "the non-algorithmic nature of mathematical insight", Penrose, Roger (1990). "Where lies the physics of mind?". The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford: Oxford University Press. pp. 416–418. ISBN 978-0-19-851973-7. OCLC 456785846.
Burgin, Mark (2005). Super-Recursive Algorithms. Monographs in Computer Science. New York: Springer. ISBN 978-0-387-95569-8. OCLC 990755791.

Church–Turing thesis (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

archive.org (Global: 6th place; English: 6th place)

books.google.com (Global: 3rd place; English: 3rd place)

chalmers.se (Global: low place; English: 7,981st place)

cse.chalmers.se

claymath.org (Global: 8,402nd place; English: 8,241st place)

doi.org (Global: 2nd place; English: 2nd place)

eatcs.org (Global: low place; English: low place)

elsevier.com (Global: 610th place; English: 704th place)

linkinghub.elsevier.com

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

huji.ac.il (Global: 3,903rd place; English: 3,632nd place)

moon.cc.huji.ac.il

jstor.org (Global: 26th place; English: 20th place)

logicmatters.net (Global: low place; English: low place)

merriam-webster.com (Global: 209th place; English: 191st place)

ox.ac.uk (Global: 613th place; English: 456th place)

comlab.ox.ac.uk

princeton.edu (Global: 741st place; English: 577th place)

findingaids.princeton.edu

webspace.princeton.edu

cs.princeton.edu

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

pdfs.semanticscholar.org

stanford.edu (Global: 179th place; English: 183rd place)

plato.stanford.edu

turing.org.uk (Global: low place; English: low place)

umsl.edu (Global: 8,618th place; English: 7,478th place)

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

acm.org (Global: 1,185^th place; English: 840^th place)

archive.org (Global: 6^th place; English: 6^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

chalmers.se (Global: low place; English: 7,981^st place)

claymath.org (Global: 8,402^nd place; English: 8,241^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

elsevier.com (Global: 610^th place; English: 704^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

huji.ac.il (Global: 3,903^rd place; English: 3,632^nd place)

jstor.org (Global: 26^th place; English: 20^th place)

merriam-webster.com (Global: 209^th place; English: 191^st place)

ox.ac.uk (Global: 613^th place; English: 456^th place)

princeton.edu (Global: 741^st place; English: 577^th place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

stanford.edu (Global: 179^th place; English: 183^rd place)

umsl.edu (Global: 8,618^th place; English: 7,478^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)