Editing Church–Turing thesis (section)

==References==
{{refbegin}}
* {{cite book |editor1-link=Jon Barwise |editor1-last=Barwise |editor1-first=Jon |editor2-link=H. J. Keisler |editor2-last=Keisler |editor2-first=H.J. |editor3-link=Kenneth Kunen |editor3-last=Kunen |editor3-first=Kenneth |date=1980 |title=The Kleene Symposium |publisher=North-Holland Publishing Company |location=Amsterdam |isbn=978-0-444-85345-5| ref=none}}
* {{cite journal|last=Ben-Amram|first=A. M.|date=2005|title=The Church-Turing Thesis and its Look-Alikes|journal=[[SIGACT News]]|volume=36|issue=3|pages=113–116|doi=10.1145/1086649.1086651|url=http://www2.mta.ac.il/~amirben/downloadable/church-turing.ps|format=PS|citeseerx=10.1.1.74.7308|s2cid=13566703|access-date=2017-10-24 |archive-date=2017-07-06 |archive-url=https://web.archive.org/web/20170706063735/http://www2.mta.ac.il/~amirben/downloadable/church-turing.ps|url-status=dead| ref=none}}
* {{cite journal|last1=Bernstein|first1=E.|author-last2=Vazirani |author-first2=U.|date=1997|title=Quantum complexity theory|journal=[[SIAM Journal on Computing]]|volume=26|issue=5|pages=1411–1473|doi=10.1137/S0097539796300921|citeseerx=10.1.1.655.1186}}
* {{cite journal|last1=Blass|first1=Andreas|author1-link=Andreas Blass|author2-link=Yuri Gurevich|last2=Gurevich|first2=Yuri|date=October 2003|title=Algorithms: A Quest for Absolute Definitions|journal=Bulletin of European Association for Theoretical Computer Science|issue=81|url=http://research.microsoft.com/~gurevich/Opera/164.pdf|archive-url=https://web.archive.org/web/20040727024450/http://research.microsoft.com/~gurevich/Opera/164.pdf|archive-date=2004-07-27|url-status=live}}{{Page needed|date=November 2017}}
* {{cite book|last=Burgin|first=Mark|title=Monographs in computer science|publisher=Springer|date=2005|chapter=Super-recursive algorithms|isbn=978-0-387-95569-8}}
* {{cite journal|last=Church|first=Alonzo|date=1932|title=A set of Postulates for the Foundation of Logic|journal=Annals of Mathematics|issue=2|volume=33|pages=346–366| jstor=1968337|doi=10.2307/1968337}}
* {{cite journal|last=Church|first=Alonzo|date=April 1936a|title=An Unsolvable Problem of Elementary Number Theory|journal=American Journal of Mathematics|issue=2|pages=345–363|jstor=2371045|volume=58|doi=10.2307/2371045|s2cid=14181275|url=https://pdfs.semanticscholar.org/ee95/8b752cdfc62c16289cd8d3b7274a2e09b14e.pdf|archive-url=https://web.archive.org/web/20200227091349/https://pdfs.semanticscholar.org/ee95/8b752cdfc62c16289cd8d3b7274a2e09b14e.pdf|url-status=dead|archive-date=2020-02-27}}
* {{cite journal|last=Church|first=Alonzo|date=June 1936b|title=A Note on the Entscheidungsproblem|journal=Journal of Symbolic Logic|volume=1|issue=1|pages=40–41|doi=10.2307/2269326|jstor=2269326|s2cid=42323521 }}
* {{cite journal|last=Church|first=Alonzo|date=March 1937|title=Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem|journal=Journal of Symbolic Logic|volume=2|issue=1|pages=42–43|doi=10.2307/2268810|jstor=2268810}}
*{{cite book|last=Church|first=Alonzo|title=The Calculi of Lambda-Conversion|publisher=Princeton University Press|location=Princeton|date=1941}}
* {{cite book|last=Cooper|first=S. B.|author2=Odifreddi, P.|title=Computability and Models: Perspectives East and West|editor=S. B. Cooper |editor2=S. S. Goncharov|publisher=Kluwer Academic/Plenum Publishers|date=2003|pages=137–160|chapter=Incomputability in Nature}}
* {{cite book|title=The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions|url=https://archive.org/details/undecidablebasic0000davi|url-access=registration|editor-link=Martin Davis (mathematician)|editor-last=Davis|editor-first=Martin|publisher=Raven Press|location=New York|date=1965}} Includes original papers by Gödel, Church, Turing, Rosser, Kleene, and Post mentioned in this section.
* {{cite book|last=Dawson |first=John W. Jr. |date=1997 |title=Logical Dilemmas: The Life and Work of Kurt Gödel |publisher=[[A. K. Peters]] |location=Wellesley, Massachusetts, US}}
* {{cite journal|last1=Eberbach|first1=E.|last2=Wegner|first2=P.|date=October 2003|title=Beyond Turing Machines|journal=Bulletin of the European Association for Theoretical Computer Science|issue=81|pages=279–304|url=http://eatcs.org/images/bulletin/beatcs81.pdf#page=287|archive-url=https://web.archive.org/web/20160315185357/http://eatcs.org/images/bulletin/beatcs81.pdf|archive-date=2016-03-15|url-status=live|citeseerx=10.1.1.61.9759}}
* {{cite book|last=Gabbay|first=D. M.|date=2001|title=Handbook of Philosophical Logic|edition=2nd|volume=1}}
* {{cite book|last=Gandy|first=Robin|title=The Kleene Symposium|editor=H. J. Barwise |editor2=H. J. Keisler |editor3=K. Kunen|publisher=North-Holland Publishing Company|date=1980|pages=123–148|chapter=Church's Thesis and the Principles for Mechanisms|author-link=Robin Gandy}}
* {{cite book|last=Gandy|first=Robin|title=The universal Turing Machine: A Half-Century Survey|editor-first=Rolf |editor-last=Herken|publisher=Wien Springer–Verlag|location=New York|date=1994|pages=51ff|isbn=978-3-211-82637-9}}
* {{cite book|last=Gödel|first=Kurt|others=Kleene and Rosser (lecture note-takers); Institute for Advanced Study (lecture sponsor)|title=The Undecidable|url=https://archive.org/details/undecidablebasic0000davi|url-access=registration|editor-last=Davis|editor-first=Martin|publisher=Raven Press|location=New York|date=1965|chapter=On Undecidable Propositions of Formal Mathematical Systems|orig-date=1934}}
* {{cite journal|first=Kurt|last=Gödel|title=Über die Lāange von Beweisen|trans-title=On The Length of Proofs|date=1936|journal=Ergenbnisse Eines Mathematishen Kolloquiums|publisher=Heft|issue=7|pages=23–24|language=de}} Cited by {{harvtxt|Kleene|1952}}.
* {{cite journal|last=Gurevich|first=Yuri|date=June 1988|title=On Kolmogorov Machines and Related Issues|journal=Bulletin of European Association for Theoretical Computer Science|issue=35|pages=71–82|author-link=Yuri Gurevich}}
* {{cite journal|last=Gurevich|first=Yuri|date=July 2000|title=Sequential Abstract State Machines Capture Sequential Algorithms|journal=ACM Transactions on Computational Logic|volume=1|issue=1|pages=77–111|url=http://research.microsoft.com/~gurevich/Opera/141.pdf|archive-url=https://web.archive.org/web/20031016105643/http://research.microsoft.com/~gurevich/Opera/141.pdf|archive-date=2003-10-16|url-status=live|doi=10.1145/343369.343384|citeseerx=10.1.1.146.3017|s2cid=2031696}}
* {{cite journal|last=Herbrand|first=Jacques|date=1932|title=Sur la non-contradiction de l'arithmétique|journal=Journal für die Reine und Angewandte Mathematik|language=fr|volume=166|pages=1–8|doi=10.1515/crll.1932.166.1 |s2cid=116636410 |author-link=Jacques Herbrand}}
* {{cite book|last=Hofstadter|first=Douglas R.|title=Gödel, Escher, Bach: an Eternal Golden Braid|chapter=Chapter XVII: Church, Turing, Tarski, and Others|author-link=Douglas Hofstadter|title-link=Gödel, Escher, Bach: an Eternal Golden Braid |date=5 February 1999 |edition=Twentieth-anniversary |publisher=[[Basic Books]] |pages=559–585 |isbn=0-465-02656-7}}
* {{cite journal|last=Kleene|first=Stephen Cole|date=January 1935|title=A Theory of Positive Integers in Formal Logic|journal=American Journal of Mathematics|issue=1|pages=153–173 & 219–244|author-link=Stephen Cole Kleene|jstor=2372027|volume=57|doi=10.2307/2372027}}
* {{cite journal|last=Kleene|first=Stephen Cole|date=1936|title=Lambda-Definability and Recursiveness|journal=[[Duke Mathematical Journal]]|volume=2|issue=2|pages=340–353|doi=10.1215/s0012-7094-36-00227-2 }}
* {{cite journal|last=Kleene|first=Stephen Cole|title= Recursive Predicates and Quantifiers|journal=Transactions of the American Mathematical Society |volume=  53| issue =  1 |pages=41–73|date=1943 |doi= 10.2307/1990131|jstor=1990131 |doi-access=free}} Reprinted in [[#{{harvid|Davis|1965}}|''The Undecidable'']], p.&nbsp;255ff. Kleene refined his definition of "general recursion" and proceeded in his chapter "12. Algorithmic theories" to posit "Thesis I" (p.&nbsp;274); he would later repeat this thesis (in {{harvcolnb|Kleene|1952|page=300}}) and name it "Church's Thesis" {{harvcol|Kleene|1952|page=317}} (i.e., the [[Church thesis]]).
* {{cite book|last=Kleene|first=Stephen Cole|title=Introduction to Metamathematics|publisher=North-Holland|date=1952|oclc=523942}}
* {{cite book|last=Knuth|first=Donald|title=The Art of Computer Programming|publisher=Addison–Wesley|date=1973|edition=2nd|volume=1/Fundamental Algorithms|author-link=Donald Knuth}}
* {{cite journal|last=Kugel|first=Peter|date=November 2005|journal=Communications of the ACM|title=It's time to think outside the computational box|volume=48|issue=11|pages=32–37|doi=10.1145/1096000.1096001|citeseerx=10.1.1.137.6939|s2cid=29843806}}
* {{cite book|author=Lewis, H.R.|author-link=Harry R. Lewis|author2=Papadimitriou, C.H. |author-link2=Christos H. Papadimitriou |title=Elements of the Theory of Computation|publisher=Prentice-Hall|location=Upper Saddle River, New Jersey, US|date=1998}}
*{{cite book|last=Manna|first=Zohar|title=Mathematical Theory of Computation|location=Dover|orig-date=1974|isbn=978-0-486-43238-0|date=2003|author-link=Zohar Manna}}
*{{cite journal|last=Markov|first=A. A.|date=1960|title=The Theory of Algorithms|journal=American Mathematical Society Translations|volume=2|issue=15|pages=1–14|orig-date=1954|author-link=Andrey Markov Jr.}}
* {{cite book|editor1-last=Olszewski|editor1-first=Adam |editor2-last=Woleński |editor2-first=Jan |editor3-last=Janusz |editor3-first=Robert |date=2006 |title=Church's Thesis After 70 Years |publisher=Ontos |location=Frankfurt |isbn=978-3-938793-09-1 |oclc=909679288 }}
* {{cite book|author=Pour-El, M. B.|author-link=Marian Pour-El|author2=Richards, J.I.|title=Computability in Analysis and Physics|title-link= Computability in Analysis and Physics |publisher=[[Springer Verlag]]|date=1989}}
* {{cite journal|last=Rosser|first=J. B.|date=1939|title=An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem|journal=The Journal of Symbolic Logic|volume=4|pages=53–60|author-link=J. B. Rosser|doi=10.2307/2269059|jstor=2269059|issue=2|s2cid=39499392 }}
* {{cite book |editor1-last=Sieg |editor1-first=Wilfried |editor2-first=Richard |editor2-last=Sommer |editor3-first=Carolyn |editor3-last=Talcott |date=2002 |title=Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman |series=Lecture Notes in Logic |volume=15 |publisher=[[A. K. Peters, Ltd.]] |isbn=978-1-56881-169-7 }}
* {{cite book|last=Syropoulos|first=Apostolos|date=2008|title=Hypercomputation: Computing Beyond the Church–Turing Barrier|publisher=Springer|isbn=978-0-387-30886-9}}
* {{Citation | last = Turing | first = A. M. | author-link = Alan Turing | date = 1937a | title = On Computable Numbers, with an Application to the Entscheidungsproblem | orig-date = Delivered to the Society November 1936 | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 42 | pages = 230–265 | doi = 10.1112/plms/s2-42.1.230 | s2cid = 73712 | url = http://www.comlab.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf }} and {{Cite news| last = Turing | first = A. M. | publication-date = 1937 | title = On Computable Numbers, with an Application to the Entscheidungsproblem: A correction | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 43 | pages = 544–546 | doi = 10.1112/plms/s2-43.6.544 | date = 1938 }} (See also: {{harvcolnb|Davis|1965|pages=115ff.}})
* {{cite journal | first=Alan Mathison | last=Turing | title=Computability and λ-Definability | journal=Journal of Symbolic Logic | volume=2 | number=4 | pages=153&ndash;163 | date=December 1937b | jstor=2268280 | doi=10.2307/2268280 | s2cid=2317046 | url=http://pdfs.semanticscholar.org/ee8c/779e7823814a5f1746d883ca77b26671b617.pdf | archive-url=https://web.archive.org/web/20200809215242/http://pdfs.semanticscholar.org/ee8c/779e7823814a5f1746d883ca77b26671b617.pdf | url-status=dead | archive-date=2020-08-09 }}
{{refend}}