{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T02:31:13Z","timestamp":1772073073575,"version":"3.50.1"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2018,12,19]]},"abstract":"<jats:p>\n            In its original form, the Church-Turing thesis concerned computation as Alan Turing and Alonzo Church used the term in 1936---\n            <jats:italic>human<\/jats:italic>\n            computation.\n          <\/jats:p>","DOI":"10.1145\/3198448","type":"journal-article","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T13:35:46Z","timestamp":1545312946000},"page":"66-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["The Church-Turing thesis"],"prefix":"10.1145","volume":"62","author":[{"given":"B. Jack","family":"Copeland","sequence":"first","affiliation":[{"name":"University of Canterbury in Christchurch, New Zealand and University of Canterbury"}]},{"given":"Oron","family":"Shagrir","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics","author":"Aharonov D.","year":"2013","unstructured":"Aharonov , D. and Vazirani , U.V . Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics . Chapter in Computability: G\u00f6del, Turing, Church and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press , Cambridge, MA, 2013 . Aharonov, D. and Vazirani, U.V. Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics. Chapter in Computability: G\u00f6del, Turing, Church and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press, Cambridge, MA, 2013."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9114-3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature16059"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371045"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1177\/0002764297040006003"},{"key":"e_1_2_1_7_1","volume-title":"Even Turing machines can compute uncomputable functions","author":"Copeland B.J.","year":"1998","unstructured":"Copeland , B.J. Even Turing machines can compute uncomputable functions . Chapter in Unconventional Models of Computation, C. Calude, J. Casti, and M. Dinneen, Eds. Springer , Singapore, 1998 . Copeland, B.J. Even Turing machines can compute uncomputable functions. Chapter in Unconventional Models of Computation, C. Calude, J. Casti, and M. Dinneen, Eds. Springer, Singapore, 1998."},{"key":"e_1_2_1_8_1","first-page":"1","volume":"97","author":"Copeland B.J.","year":"2000","unstructured":"Copeland , B.J. Narrow versus wide mechanism: Including a re-examination of Turing's views on the mind-machine issue. The Journal of Philosophy 97 , 1 ( Jan. 2000 ), 5--32. Copeland, B.J. Narrow versus wide mechanism: Including a re-examination of Turing's views on the mind-machine issue. The Journal of Philosophy 97, 1 (Jan. 2000), 5--32.","journal-title":"The Journal of Philosophy"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021105915386"},{"key":"e_1_2_1_10_1","volume-title":"Logic, Philosophy, Artificial Intelligence, and Artificial Life, Plus the Secrets of Enigma","author":"Copeland B.J.","year":"2004","unstructured":"Copeland , B.J. The Essential Turing: Seminal Writings in Computing , Logic, Philosophy, Artificial Intelligence, and Artificial Life, Plus the Secrets of Enigma . Oxford University Press , Oxford, U.K. , 2004 . Copeland, B.J. The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life, Plus the Secrets of Enigma. Oxford University Press, Oxford, U.K., 2004."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0499-98"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11023-011-9238-y"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8009.001.0001","volume-title":"Turing versus G\u00f6del on computability and the mind","author":"Copeland B.J.","year":"2013","unstructured":"Copeland , B.J. and Shagrir , 0. Turing versus G\u00f6del on computability and the mind . Chapter in Computability: G\u00f6del, Turing, Church , and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press , Cambridge, MA, 2013 . Copeland, B.J. and Shagrir, 0. Turing versus G\u00f6del on computability and the mind. Chapter in Computability: G\u00f6del, Turing, Church, and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press, Cambridge, MA, 2013."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature16059"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91218-9"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1231081370"},{"key":"e_1_2_1_17_1","first-page":"1818","volume":"400","author":"Deutsch D.","year":"1985","unstructured":"Deutsch , D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A: Mathematical , Physical and Engineering Sciences 400 , 1818 ( July 1985 ), 97--117. Deutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 400, 1818 (July 1985), 97--117.","journal-title":"Physical and Engineering Sciences"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021126521437"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.260501"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the Kleene Symposium, J. Barwise, H.J. Keisler, and K. Kunen, Eds.","author":"Gandy R.O.","year":"1978","unstructured":"Gandy , R.O. Church's thesis and principles for mechanisms . In Proceedings of the Kleene Symposium, J. Barwise, H.J. Keisler, and K. Kunen, Eds. ( Madison, WI , June 1978 ). North-Holland, Amsterdam, Netherlands, 1980. Gandy, R.O. Church's thesis and principles for mechanisms. In Proceedings of the Kleene Symposium, J. Barwise, H.J. Keisler, and K. Kunen, Eds. (Madison, WI, June 1978). North-Holland, Amsterdam, Netherlands, 1980."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity: A Conceptual Perspective","author":"Goldreich O.","year":"2008","unstructured":"Goldreich , O. Computational Complexity: A Conceptual Perspective . Cambridge University Press , New York , 2008 . Goldreich, O. Computational Complexity: A Conceptual Perspective. Cambridge University Press, New York, 2008."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27660-6_3"},{"key":"e_1_2_1_23_1","volume-title":"D","author":"Harel","year":"1992","unstructured":"Harel , D . Algorithmics : The Spirit of Computing, Second Edition. Addison-Wesley , Reading, MA, 1992 . Harel, D. Algorithmics: The Spirit of Computing, Second Edition. Addison-Wesley, Reading, MA, 1992."},{"key":"e_1_2_1_24_1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J.E.","year":"1979","unstructured":"Hopcroft , J.E. and Ullman , J.D . Introduction to Automata Theory, Languages, and Computation . Addison-Wesley , Reading, MA , 1979 . Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979."},{"key":"e_1_2_1_25_1","volume-title":"Introduction to Metamathematics","author":"Kleene S.C.","year":"1952","unstructured":"Kleene , S.C. Introduction to Metamathematics . Van Nostrand , New York , 1952 . Kleene, S.C. Introduction to Metamathematics. Van Nostrand, New York, 1952."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.133.B542"},{"key":"e_1_2_1_27_1","volume-title":"Mathematical logic: What has it done for the philosophy of mathematics?","author":"Kreisel G.","year":"1967","unstructured":"Kreisel , G. Mathematical logic: What has it done for the philosophy of mathematics? Chapter in Bertrand Russell: Philosopher of the Century, R. Schoenman, Ed . Allen and Unwin, London, U.K. , 1967 . Kreisel, G. Mathematical logic: What has it done for the philosophy of mathematics? Chapter in Bertrand Russell: Philosopher of the Century, R. Schoenman, Ed. Allen and Unwin, London, U.K., 1967."},{"key":"e_1_2_1_28_1","volume-title":"Another approach: The Church-Turing 'thesis' as a special corollary of G\u00f6del's completeness theorem","author":"Kripke S.A.","year":"2013","unstructured":"Kripke , S.A. Another approach: The Church-Turing 'thesis' as a special corollary of G\u00f6del's completeness theorem . Chapter in Computability: G\u00f6del, Turing, Church , and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press , Cambridge, MA, 2013 . Kripke, S.A. Another approach: The Church-Turing 'thesis' as a special corollary of G\u00f6del's completeness theorem. Chapter in Computability: G\u00f6del, Turing, Church, and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press, Cambridge, MA, 2013."},{"key":"e_1_2_1_29_1","volume-title":"Elements of the Theory of Computation","author":"Lewis H.R.","year":"1981","unstructured":"Lewis , H.R. and Papadimitriou , C.H . Elements of the Theory of Computation . Prentice Hall , Upper Saddle River, NJ, 1981 . Lewis, H.R. and Papadimitriou, C.H. Elements of the Theory of Computation. Prentice Hall, Upper Saddle River, NJ, 1981."},{"key":"e_1_2_1_30_1","volume-title":"Elementary algorithms and their implementations","author":"Moschovakis Y.N.","year":"2008","unstructured":"Moschovakis , Y.N. and Paschalis , V . Elementary algorithms and their implementations . Chapter in New Computational Paradigms: Changing Conceptions of What Is Computable, S.B. Cooper, B. Lowe, and A. Sorbi, Eds. Springer , New York, 2008 . Moschovakis, Y.N. and Paschalis, V. Elementary algorithms and their implementations. Chapter in New Computational Paradigms: Changing Conceptions of What Is Computable, S.B. Cooper, B. Lowe, and A. Sorbi, Eds. Springer, New York, 2008."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/bjps\/axr016"},{"key":"e_1_2_1_32_1","first-page":"1","volume":"39","author":"Pitowsky I.","year":"1990","unstructured":"Pitowsky , I. The physical Church thesis and physical computational complexity. Iyyun 39 , 1 ( Jan. 1990 ), 81--99. Pitowsky, I. The physical Church thesis and physical computational complexity. Iyyun 39, 1 (Jan. 1990), 81--99.","journal-title":"Iyyun"},{"key":"e_1_2_1_33_1","first-page":"3","volume":"1","author":"Post E.L.","year":"1936","unstructured":"Post , E.L. Finite combinatory processes : Formulation I. The Journal of Symbolic Logic 1 , 3 ( Sept. 1936 ), 103--105. Post, E.L. Finite combinatory processes: Formulation I. The Journal of Symbolic Logic 1, 3 (Sept. 1936), 103--105.","journal-title":"Formulation I. The Journal of Symbolic Logic"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(81)90001-3"},{"key":"e_1_2_1_35_1","volume-title":"Mechanical procedures and mathematical experience","author":"Sieg W.","year":"1994","unstructured":"Sieg , W. Mechanical procedures and mathematical experience . Chapter in Mathematics and Mind, A. George, Ed . Oxford University Press , New York, 1994 . Sieg, W. Mechanical procedures and mathematical experience. Chapter in Mathematics and Mind, A. George, Ed. Oxford University Press, New York, 1994."},{"key":"e_1_2_1_36_1","volume-title":"On computable numbers, with an application to the Entscheidungsproblem (1936)","author":"Turing A.M.","unstructured":"Turing , A.M. On computable numbers, with an application to the Entscheidungsproblem (1936) ; in Copeland .<sup>&lt;zref=R10&gt;10&lt;zrefx&gt;<\/sup> Turing, A.M. On computable numbers, with an application to the Entscheidungsproblem (1936); in Copeland.<sup>&lt;zref=R10&gt;10&lt;zrefx&gt;<\/sup>"},{"key":"e_1_2_1_37_1","volume-title":"Lecture on the Automatic Computing Engine (1947)","author":"Turing A.M.","unstructured":"Turing , A.M. Lecture on the Automatic Computing Engine (1947) ; in Copeland .<sup>&lt;zref=R10&gt;10&lt;zrefx&gt;<\/sup> Turing, A.M. Lecture on the Automatic Computing Engine (1947); in Copeland.<sup>&lt;zref=R10&gt;10&lt;zrefx&gt;<\/sup>"},{"key":"e_1_2_1_38_1","volume-title":"Intelligent Machinery (1948)","author":"Turing A.M.","unstructured":"Turing , A.M. Intelligent Machinery (1948) ; in Copeland .<sup>&lt;zref=R10&gt;10&lt;zrefx&gt;<\/sup> Turing, A.M. Intelligent Machinery (1948); in Copeland.<sup>&lt;zref=R10&gt;10&lt;zrefx&gt;<\/sup>"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.54.735"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/602382.602411"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3198448","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3198448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:24Z","timestamp":1750268964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3198448"}},"subtitle":["logical limit or breachable barrier?"],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12,19]]}},"alternative-id":["10.1145\/3198448"],"URL":"https:\/\/doi.org\/10.1145\/3198448","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,19]]},"assertion":[{"value":"2018-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}