Linked bibliography for the SEP article "The Church-Turing Thesis" by B. Jack Copeland
This is an automatically generated and experimental page
If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.
This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.
- Ackermann, Wilhelm, 1928, “Zum Hilbertschen Aufbau der
reellen Zahlen”, Mathematische Annalen, 99(1):
118–133. doi:10.1007/bf01459088 (Scholar)
- Aharonov, Dorit and Umesh V. Vazirani, 2013, “Is Quantum
Mechanics Falsifiable? A Computational Perspective on the Foundations
of Quantum Mechanics”, in Copeland, Posy, and Shagrir 2013:
329–349 (ch. 11). (Scholar)
- Andréka, Hajnal, István Németi, and
Péter Németi, 2009, “General Relativistic
Hypercomputing and Foundation of Mathematics”, Natural
Computing, 8(3): 499–516.
doi:10.1007/s11047-009-9114-3 (Scholar)
- Baldwin, J. Mark, 1902, “Logical Machine”, in J. Mark
Baldwin (ed.), Dictionary of Philosophy and Psychology,
volume 2, New York: Macmillan, 28–30. (Scholar)
- Barendregt, Henk, 1997, “The Impact of the Lambda Calculus in Logic and Computer Science”, Bulletin of Symbolic Logic, 3(2): 181–215. doi:10.2307/421013 (Scholar)
- Barrett, Lindsay and Matthew Connell, 2005, “Jevons and the
Logic ‘Piano’”, The Rutherford Journal, 1:
article 3.
[Barrett & Connell 2005 available online] (Scholar)
- Barwise, Jon, 1977, “An Introduction to First-Order
Logic”, in Jon Barwise (ed.), Handbook of Mathematical
Logic, Amsterdam: North-Holland, 5–46. (Scholar)
- Bausch, Johannes, Toby S. Cubitt, Angelo Lucia, and David
Perez-Garcia, 2020, “Undecidability of the Spectral Gap in One
Dimension”, Physical Review X, 10(3): 031038.
doi:10.1103/physrevx.10.031038 (Scholar)
- Bausch, Johannes, Toby S. Cubitt, and James D. Watson, 2019,
“Uncomputability of Phase Diagrams”,
arXiv:1910.01631. (Scholar)
- –––, 2021, “Uncomputability of Phase
Diagrams”, Nature Communications, 12(1): article 452.
doi:10.1038/s41467-020-20504-6 (Scholar)
- Behmann, Heinrich, 1921 [2015], “Entscheidungsproblem und
Algebra der Logik”, Lecture, 10 May 1921, to the Göttingen
Mathematical Society. In Mancosu and Zach 2015: 177–187, with a
partial translation by Richard Zach in the same (2015:
173–177). (Scholar)
- –––, 1922, “Beiträge zur Algebra der
Logik, insbesondere zum Entscheidungsproblem”, Mathematische
Annalen, 88(1–2): 168–168.
doi:10.1007/bf01448447 (Scholar)
- Bernays, Paul, 1918, “Beiträge zur axiomatischen
Behandlung des Logik-Kalküls”, Habilitationsschrift,
University of Göttingen. Bernays Papers, ETH Zurich (Hs
973.192). (Scholar)
- Bernays, Paul and Moses Schönfinkel, 1928, “Zum
Entscheidungsproblem der mathematischen Logik”,
Mathematische Annalen, 99(1): 342–372.
doi:10.1007/BF01459101 (Scholar)
- Bernstein, Ethan and Umesh Vazirani, 1997, “Quantum
Complexity Theory”, SIAM Journal on Computing, 26(5):
1411–1473. doi:10.1137/s0097539796300921 (Scholar)
- Blum, Lenore, Felipe Cucker, Michael Shub, and Steve Smale, 1998,
Complexity and Real Computation, New York: Springer.
doi:10.1007/978-1-4612-0701-6 (Scholar)
- Boolos, George and Richard C. Jeffrey, 1974, Computability and
Logic, New York: Cambridge University Press. (Scholar)
- Buss, Samuel R., Alexander S. Kechris, Anand Pillay, and Richard A. Shore, 2001, “The Prospects for Mathematical Logic in the Twenty-First Century”, Bulletin of Symbolic Logic, 7(2): 169–196. doi:10.2307/2687773 (Scholar)
- Calude, Cristian S. and Karl Svozil, 2008, “Quantum
Randomness and Value Indefiniteness”, Advanced Science
Letters, 1(2): 165–168. doi:10.1166/asl.2008.016 (Scholar)
- Calude, Cristian S., Michael J. Dinneen, Monica Dumitrescu, and
Karl Svozil, 2010, “Experimental Evidence of Quantum Randomness
Incomputability”, Physical Review A, 82(2): 022102.
doi:10.1103/physreva.82.022102 (Scholar)
- Cantor, Georg, 1874, “Ueber eine Eigenschaft des Inbegriffs
aller reellen algebraischen Zahlen”, Journal für die
reine und angewandte Mathematik, 77: 258–262.
doi:10.1515/crll.1874.77.258 (Scholar)
- Carnap, Rudolf, 1935, “Ein Gültigkeitskriterium
für die Sätze der klassischen Mathematik”,
Monatshefte für Mathematik und Physik, 42:
163–190. doi:10.1007/bf01733289 (Scholar)
- Cassirer, Ernst, 1929, Philosophie der symbolischen Formen (Volume 3: Phänomenologie der Erkenntnis), Berlin: Bruno Cassirer. (Scholar)
- Church, Alonzo, 1932, “A Set of Postulates for the
Foundation of Logic”, Annals of Mathematics, second
series 33(2): 346–366. doi:10.2307/1968337 (Scholar)
- –––, 1933, “A Set of Postulates For the
Foundation of Logic (2)”, Annals of Mathematics, second
series 34(4): 839–864. doi:10.2307/1968702 (Scholar)
- –––, 1935a, “An Unsolvable Problem of
Elementary Number Theory, Preliminary Report” (abstract),
Bulletin of the American Mathematical Society, 41(6):
332–333. Full paper in Church 1936b. (Scholar)
- –––, 1935b, letter to Kleene, 29 November 1935.
Excerpt in Davis 1982: 9. (Scholar)
- –––, 1935c, “A Proof of Freedom from
Contradiction”, Proceedings of the National Academy of
Sciences, 21(5): 275–281. doi:10.1073/pnas.21.5.275 (Scholar)
- –––, 1936a, “An Unsolvable Problem of
Elementary Number Theory”, American Journal of
Mathematics, 58(2): 345–363. doi:10.2307/2371045 (Scholar)
- –––, 1936b, “A Note on the Entscheidungsproblem”, The Journal of Symbolic Logic, 1(1): 40–41. doi:10.2307/2269326 (Scholar)
- –––, 1937a, Review of Turing 1936, The
Journal of Symbolic Logic, 2(1): 42–43.
doi:10.1017/S002248120003958X (Scholar)
- –––, 1937b, Review of Post 1936, The Journal
of Symbolic Logic, 2(1): 43. doi:10.1017/S0022481200039591 (Scholar)
- –––, 1941, The Calculi of
Lambda-Conversion, Princeton, NJ: Princeton University
Press. (Scholar)
- Church, Alonzo and J. Barkley Rosser, 1936, “Some Properties
of Conversion”, Transactions of the American Mathematical
Society, 39(3): 472–482.
doi:10.1090/s0002-9947-1936-1501858-0 (Scholar)
- Copeland, B. Jack, 1998a, “Even Turing Machines Can Compute
Uncomputable Functions”, in Unconventional Models of
Computation, Proceedings of the 1st International Conference, New
Zealand, Christian S. Calude, John Casti, and Michael J. Dinneen
(eds), London: Springer-Verlag, 150–164. (Scholar)
- –––, 1998b, “Super Turing-Machines”,
Complexity, 4(1): 30–32.
doi:10.1002/(sici)1099-0526(199809/10)4:1<30::AID-CPLX9>3.0.CO;2-8 (Scholar)
- –––, 2000, “Narrow versus Wide Mechanism:
Including a Re-Examination of Turing’s Views on the Mind-Machine
Issue”, The Journal of Philosophy, 97(1): 5–32.
doi:10.2307/2678472 (Scholar)
- –––, 2002a, “Accelerating Turing Machines”, Minds and Machines, 12(2): 281–300. (In a special issue on the Church-Turing thesis, edited by Carol Cleland.) doi:10.1023/a:1015607401307 (Scholar)
- ––– (ed.), 2004, The Essential Turing:
Seminal Writings in Computing, Logic, Philosophy, Artificial
Intelligence, and Artificial Life, Oxford: Clarendon Press.
doi:10.1093/oso/9780198250791.001.0001 (Scholar)
- Copeland, B. Jack and Zhao Fan, 2022, “Did Turing Stand on
Gödel’s Shoulders?”, The Mathematical
Intelligencer, 44: 308–319.
doi:10.1007/s00283-022-10177-y (Scholar)
- –––, 2023, “Turing and von Neumann: From Logic to the Computer”, Philosophies, 8(2): 1–30. (Scholar)
- Copeland, B. Jack, Carl J. Posy, and Oron Shagrir (eds), 2013,
Computability: Turing, Gödel, Church, and Beyond,
Cambridge, MA: The MIT Press. (Scholar)
- Copeland, B. Jack and Oron Shagrir, 2007, “Physical Computation: How General Are Gandy’s Principles for Mechanisms?”, Minds and Machines, 17(2): 217–231. doi:10.1007/s11023-007-9058-2 (Scholar)
- –––, 2011, “Do Accelerating Turing Machines Compute the Uncomputable?”, Minds and Machines, 21(2): 221–239. doi:10.1007/s11023-011-9238-y (Scholar)
- –––, 2013, “Turing versus Gödel on
Computability and the Mind”, in Copeland, Posy, and Shagrir
2013: 1–33 (ch. 1). (Scholar)
- –––, 2019, “The Church-Turing Thesis:
Logical Limit or Breachable Barrier?”, Communications of the
ACM, 62(1): 66–74. doi:10.1145/3198448 (Scholar)
- –––, 2020, “Physical Computability
Theories”, in Quantum, Probability, Logic: The Work and
Influence of Itamar Pitowsky, Meir Hemmo and Orly Shenker (eds),
Cham: Springer: 217–231. (Scholar)
- Copeland, B. Jack, Oron Shagrir, and Mark Sprevak, 2018,
“Zuse’s Thesis, Gandy’s Thesis, and Penrose’s
Thesis”, in Physical Perspectives on Computation,
Computational Perspectives on Physics, Michael E. Cuffaro and
Samuel C. Fletcher (eds), Cambridge: Cambridge University Press,
39–59. doi:10.1017/9781316759745.003 (Scholar)
- Copeland, B. Jack and Richard Sylvan, 1999, “Beyond the Universal Turing Machine”, Australasian Journal of Philosophy, 77(1): 46–66. doi:10.1080/00048409912348801 (Scholar)
- Couturat, Louis (ed.), 1903, Opuscules et Fragments
Inédits de Leibniz, Paris: Alcan. Facsimile of the 1903
edition, Hildesheim: G. Olms, 1961. (Scholar)
- Cubitt, Toby S., David Perez-Garcia, and Michael M. Wolf, 2015,
“Undecidability of the Spectral Gap”, Nature,
528(7581): 207–211. doi:10.1038/nature16059 (Scholar)
- Curry, Haskell B., 1929, “An Analysis of Logical
Substitution”, American Journal of Mathematics, 51(3):
363–384. doi:10.2307/2370728 (Scholar)
- –––, 1930a, “Grundlagen der
kombinatorischen Logik, Teil 1”, American Journal of
Mathematics, 52(3): 509–536. doi:10.2307/2370619 (Scholar)
- –––, 1930b, “Grundlagen der
kombinatorischen Logik, Teil 2”, American Journal of
Mathematics, 52(4): 789–834. doi:10.2307/2370716 (Scholar)
- –––, 1932, “Some Additions to the Theory
of Combinators”, American Journal of Mathematics,
54(3): 551–558. doi:10.2307/2370900 (Scholar)
- Curry, Haskell B. and Robert Feys, 1958, Combinatory Logic, Amsterdam: North-Holland. (Scholar)
- da Costa, Newton C. A. and Francisco A. Doria, 1991,
“Classical Physics and Penrose’s Thesis”,
Foundations of Physics Letters, 4(4): 363–373.
doi:10.1007/bf00665895 (Scholar)
- –––, 1994, “Undecidable Hopf Bifurcation
with Undecidable Fixed Point”, International Journal of
Theoretical Physics, 33(9): 1885–1903.
doi:10.1007/bf00671031 (Scholar)
- Davies, E. Brian, 2001, “Building Infinite Machines”, The British Journal for the Philosophy of Science, 52(4): 671–682. doi:10.1093/bjps/52.4.671 (Scholar)
- Davis, Martin, 1958, Computability and Unsolvability, New York: McGraw-Hill. (Scholar)
- ––– (ed.), 1965, The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, Hewlett, NY: Raven Press. (Scholar)
- –––, 1982, “Why Gödel Didn’t
Have Church’s Thesis”, Information and Control,
54(1–2): 3–24. doi:10.1016/S0019-9958(82)91226-8 (Scholar)
- Davis, Martin and Wilfried Sieg, 2015, “Conceptual
Confluence in 1936: Post and Turing”, in Turing’s
Revolution, Giovanni Sommaruga and Thomas Strahm (eds), Cham:
Birkhäuser, 3–27. doi:10.1007/978-3-319-22156-4_1 (Scholar)
- Dawson, John W., 2006, “Gödel and the Origins of
Computer Science”, in Logical Approaches to Computational
Barriers, Arnold Beckmann, Ulrich Berger, Benedikt Löwe, and
John V. Tucker (eds), (Lecture Notes in Computer Science 3988),
Berlin/Heidelberg: Springer, 133–136.
doi:10.1007/11780342_14 (Scholar)
- Dedekind, Richard, 1888, Was Sind und was Sollen die Zahlen? Braunschweig: Vieweg. (Scholar)
- Dershowitz, Nachum and Yuri Gurevich, 2008, “A Natural Axiomatization of Computability and Proof of Church’s Thesis”, Bulletin of Symbolic Logic, 14(3): 299–350. doi:10.2178/bsl/1231081370 (Scholar)
- Deutsch, David, 1985, “Quantum Theory, the
Church–Turing Principle and the Universal Quantum
Computer”, Proceedings of the Royal Society of London.
Series A. Mathematical and Physical Sciences, 400(1818):
97–117. doi:10.1098/rspa.1985.0070 (Scholar)
- Doyle, Jon, 1982, “What is Church’s Thesis? An
Outline”, Laboratory for Computer Science, MIT. (Scholar)
- –––, 2002, “What Is Church’s Thesis? An Outline”, Minds and Machines, 12(4): 519–520. doi:10.1023/a:1021126521437 (Scholar)
- Earman, John, 1986, A Primer on Determinism, Dordrecht: Reidel. (Scholar)
- Eisert, Jens, Markus P. Müller, and Christian Gogolin, 2012,
“Quantum Measurement Occurrence Is Undecidable”,
Physical Review Letters, 108(26): 260501 (5 pages).
doi:10.1103/physrevlett.108.260501 (Scholar)
- Engeler, Erwin, 1983 [1993], Metamathematik der Elementarmathematik, Berlin: Springer. Translated as Foundations of Mathematics: Questions of Analysis, Geometry & Algorithmics, Charles B. Thomas (trans.), Berlin/New York: Springer-Verlag. (Scholar)
- Etesi, Gábor and István Németi, 2002, “Non-Turing Computations via Malament-Hogarth Space-Times”, International Journal of Theoretical Physics, 41(2): 341–370. doi:10.1023/a:1014019225365 (Scholar)
- Frankena, William and Arthur W. Burks, 1964, “Cooper Harold Langford 1895–1964”, Proceedings and Addresses of the American Philosophical Association, 38: 99–101. (Scholar)
- Gandy, Robin, 1980, “Church’s Thesis and Principles
for Mechanisms”, in The Kleene Symposium, Jon Barwise,
H. Jerome Keisler, and Kenneth Kunen (eds), Amsterdam: North-Holland,
123–148. doi:10.1016/s0049-237x(08)71257-6 (Scholar)
- –––, 1988, “The Confluence of Ideas in
1936”, in The Universal Turing Machine: A Half-Century
Survey, Rolf Herken (ed.), New York: Oxford University Press,
51–102. (Scholar)
- Geroch, Robert and James B. Hartle, 1986, “Computability and Physical Theories”, Foundations of Physics, 16(6): 533–550. doi:10.1007/bf01886519 (Scholar)
- Gödel, Kurt, 1930, “Die Vollständigkeit der Axiome
des logischen Funktionenkalküls”, Monatshefte für
Mathematik und Physik, 37: 349–360.
doi:10.1007/bf01696781 (Scholar)
- –––, 1931, “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I”, Monatshefte für Mathematik und Physik, 38: 173–198. doi:10.1007/bf01700692 (Scholar)
- –––, 1933, “Zum Entscheidungsproblem des
logischen Funktionenkalküls”, Monatshefte für
Mathematik und Physik, 40: 433–443.
doi:10.1007/bf01708881 (Scholar)
- –––, 1934 [1965], “On Undecidable
Propositions of Formal Mathematical Systems”, Lecture notes
taken by Stephen Kleene and J. Barkley Rosser at the Institute for
Advanced Study, in Davis 1965: 39–74. (Scholar)
- –––, 1936, “Über die Länge von
Beweisen”, Ergebnisse eirtes mathematischen
Kolloquiums, 7: 23–24. (Scholar)
- –––, 193?, “Undecidable Diophantine
Propositions”, in Gödel 1995: 164–175. (Scholar)
- –––, 1946, “Remarks Before the Princeton
Bicentennial Conference”, in Gödel 1990:
150–153. (Scholar)
- –––, 1951, “Some Basic Theorems on the
Foundations of Mathematics and Their Implications”, in
Gödel 1995: 304–323. (Scholar)
- –––, 1965a, “Postscriptum” to
Gödel 1934, in Davis 1965: 71–73. (Scholar)
- –––, 1965b, letter to Davis, 15 February 1965.
Excerpt in Davis 1982: 8. (Scholar)
- –––, Kurt Gödel: Collected Works,
5 volumes, Solomon Feferman et al. (eds), Oxford: Clarendon Press.
- 1986, Volume 1: Publications 1929–1936 (Scholar)
- 1990, Volume 2: Publications 1938–1974
- 1995, Volume 3: Unpublished Essays and Lectures
- Gurevich, Yuri, 2012, “What Is an Algorithm?”, in SOFSEM 2012: Theory and Practice of Computer Science, Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, and György Turán (eds), (Lecture Notes in Computer Science 7147), Berlin/Heidelberg: Springer, 31–42. doi:10.1007/978-3-642-27660-6_3 (Scholar)
- Guttenplan, Samuel D. (ed.), 1994, A Companion to the Philosophy of Mind, Oxford/Cambridge, MA: Blackwell Reference. doi:10.1002/9781405164597. (Scholar)
- Hardy, G. H., 1929, “Mathematical Proof”, Mind, 38(149): 1–25. doi:10.1093/mind/xxxviii.149.1 (Scholar)
- Harel, David, 1992, Algorithmics: The Spirit of
Computing, second edition, Reading, MA: Addison-Wesley. (Scholar)
- Herbrand, Jacques, 1930a, Recherches sur la Théorie de la Démonstration, doctoral thesis, University of Paris. In Herbrand 1968. (Scholar)
- –––, 1930b, “Les bases de la logique Hilbertienne”, Revue de Métaphysique et de Morale, 37(2): 243–255. (Scholar)
- –––, 1931a, “Sur le Problème
Fondamental de la Logique Mathématique”, Sprawozdania
z Posiedzeń Towarzystwa Naukowego Warszawskiego, Wydział
III, 24: 12–56. (Scholar)
- –––, 1931b, Precis of Herbrand 1930a,
Annales de l’Université de Paris, 6:
186–189. In Herbrand 1968. (Scholar)
- –––, 1932, “Sur la non-contradiction de
l’Arithmétique”, Journal für die reine und
angewandte Mathematik, 166: 1–8.
doi:10.1515/crll.1932.166.1 (Scholar)
- –––, 1968, Écrits Logiques,
Paris: Presses Universitaires de France. (Scholar)
- Hermes, Hans, 1969, “Ideen von Leibniz zur
Grundlagenforschung: Die Ars inveniendi und die Ars iudicandi”,
in Systemprinzip und Vielheit der Wissenschaften, Udo W.
Bargenda and Jürgen Blühdorn (eds), Wiesbaden: Franz
Steiner: 78–88. (Scholar)
- Hilbert, David, 1899, Grundlagen der Geometrie, Leipzig:
Teubner. (Scholar)
- –––, 1900 [1902], “Mathematische
Probleme”, Nachrichten von der Gesellschaft der
Wissenschaften zu Göttingen, Mathematisch-Physikalische
Klasse, 3: 253–297. Translated in 1902 as
“Mathematical Problems”, Mary Winston Newson (trans.),
Bulletin of the American Mathematical Society, 8(10):
437–480. doi:10.1090/S0002-9904-1902-00923-3 (Scholar)
- –––, 1917, “Axiomatisches Denken”,
Mathematische Annalen, 78(1–4): 405–415.
doi:10.1007/bf01457115 (Scholar)
- –––, 1922, “Neubegründung der
Mathematik. Erste Mitteilung”, Abhandlungen aus dem
Mathematischen Seminar der Universität Hamburg, 1:
157–177. doi:10.1007/BF02940589 (Scholar)
- –––, 1926 [1967], “Über das
Unendliche”, Mathematische Annalen, 95(1):
161–190. Translated as “On the Infinite” in van
Heijenoort 1967: 367–392. doi:10.1007/BF01206605 (Scholar)
- –––, 1930a, “Probleme der Grundlegung der
Mathematik”, Mathematische Annalen, 102(1): 1–9.
doi:10.1007/bf01782335 (Scholar)
- –––, 1930b, “Naturerkennen und
Logik”, Die Naturwissenschaften, 18(47–49):
959–963. doi:10.1007/bf01492194 (Scholar)
- Hilbert, David and Wilhelm Ackermann, 1928, Grundzüge der Theoretischen Logik, Berlin: Springer. (Scholar)
- –––, 1938, Grundzüge der Theoretischen Logik, Berlin: Springer. Second edition. (Scholar)
- Hilbert, David and Paul Bernays, 1934, Grundlagen der Mathematik, Volume 1, Berlin: Springer. (Scholar)
- –––, 1939, Grundlagen der Mathematik,
Volume 2, Berlin: Springer. (Scholar)
- Hobbes, Thomas, 1655 [1839], De Corpore, in
Thomæ Hobbes Malmesburiensis: Opera Philosophica
(Volume 1), William Molesworth (ed.), London: J. Bohn, 1839. (Scholar)
- Hogarth, Mark, 1994, “Non-Turing Computers and Non-Turing Computability”, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, 1994(1): 126–138. doi:10.1086/psaprocbienmeetp.1994.1.193018 (Scholar)
- –––, 2004, “Deciding Arithmetic Using SAD Computers”, The British Journal for the Philosophy of Science, 55(4): 681–691. doi:10.1093/bjps/55.4.681 (Scholar)
- Hopcroft, John E. and Jeffrey D. Ullman, 1979, Introduction to
Automata Theory, Languages, and Computation, Reading, MA:
Addison-Wesley. (Scholar)
- Houser, Nathan, Don D. Roberts, and James Van Evra (eds), 1997, Studies in the Logic of Charles Sanders Peirce, Bloomington, IN: Indiana University Press. (Scholar)
- Jevons, W. Stanley, 1870, “On the Mechanical Performance of
Logical Inference”, Philosophical Transactions of the Royal
Society of London, 160: 497–518.
doi:10.1098/rstl.1870.0022 (Scholar)
- –––, 1880, letter to Venn, 18 August 1880, Venn
Collection, Gonville and Caius College, Cambridge, C 45/4 (quoted by
permission of the Master and Fellows of Gonville and Caius). (Scholar)
- Kalmár, László, 1959, “An Argument
Against the Plausibility of Church’s Thesis”, in
Constructivity in Mathematics: Proceedings of the colloquium held
at Amsterdam 1957, Arend Heyting (ed.), Amsterdam: North-Holland:
72–80. (Scholar)
- Kennedy, Juliette, 2013, “On Formalism Freeness: Implementing Gödel’s 1946 Princeton Bicentennial Lecture”, Bulletin of Symbolic Logic, 19(3): 351–393. doi:10.1017/s1079898600010684 (Scholar)
- Ketner, Kenneth L. and Arthur F. Stewart, 1984, “The Early
History of Computer Design: Charles Sanders Peirce and
Marquand’s Logical Machines”, The Princeton University
Library Chronicle, 45(3): 187–224.
doi:10.2307/26402393 (Scholar)
- Kieu, Tien D., 2004, “Hypercomputation with Quantum
Adiabatic Processes”, Theoretical Computer Science,
317(1–3): 93–104. doi:10.1016/j.tcs.2003.12.006 (Scholar)
- Kleene, Stephen C., 1934, “Proof by Cases in Formal
Logic”, Annals of Mathematics, second series 35(3):
529–544. doi:10.2307/1968749 (Scholar)
- –––, 1935a, “A Theory of Positive Integers
in Formal Logic. Part I”, American Journal of
Mathematics, 57(1): 153–173. doi:10.2307/2372027 (Scholar)
- –––, 1935b, “A Theory of Positive Integers
in Formal Logic. Part II”, American Journal of
Mathematics, 57(2): 219–244. doi:10.2307/2371199 (Scholar)
- –––, 1936a, “General Recursive Functions
of Natural Numbers”, Mathematische Annalen, 112(1):
727–742. doi:10.1007/bf01565439 (Scholar)
- –––, 1936b, “λ-Definability and
Recursiveness”, Duke Mathematical Journal, 2(2):
340–353. doi:10.1215/s0012-7094-36-00227-2 (Scholar)
- –––, 1952, Introduction to Metamathematics, Amsterdam: North-Holland. (Scholar)
- –––, 1967, Mathematical Logic, New York: Wiley. (Scholar)
- –––, 1981, “Origins of Recursive Function
Theory”, IEEE Annals of the History of Computing, 3(1):
52–67. doi:10.1109/mahc.1981.10004 (Scholar)
- –––, 1986, “Introductory Note to
1930b, 1931 and 1932b”, in Gödel
1986: 126–141. (Scholar)
- –––, 1987, “Reflections on Church’s Thesis”, Notre Dame Journal of Formal Logic, 28(4): 490–498. doi:10.1305/ndjfl/1093637645 (Scholar)
- Kleene, Stephen C. and J. Barkley Rosser, 1935, “The
Inconsistency of Certain Formal Logics”, Annals of
Mathematics, second series 36(3): 630–636.
doi:10.2307/1968646 (Scholar)
- Kreisel, Georg, 1965, “Mathematical Logic”, in Lectures on Modern Mathematics, Volume 3, Thomas L. Saaty (ed.), New York: Wiley, 95–195. (Scholar)
- –––, 1967, “Mathematical Logic: What Has
it Done For the Philosophy of Mathematics?”, in Bertrand
Russell: Philosopher of the Century, Ralph Schoenman (ed.),
London: George Allen and Unwin: 201–272. (Scholar)
- –––, 1974, “A Notion of Mechanistic Theory”, Synthese, 29(1–4): 11–26. doi:10.1007/bf00484949 (Scholar)
- –––, 1982, Review of Pour-El and Richards 1979
and 1981, The Journal of Symbolic Logic, 47(4):
900–902. doi:10.2307/2273108 (Scholar)
- Kripke, Saul A., 2013, “The Church-Turing
‘Thesis’ as a Special Corollary of Gödel’s
Completeness Theorem”, in Copeland, Posy, and Shagrir 2013:
77–104 (ch. 4). (Scholar)
- Langford, C. Harold, 1926a, “Some Theorems on
Deducibility”, Annals of Mathematics, second series
28(1/4): 16–40. doi:10.2307/1968352 (Scholar)
- –––, 1926b, “Analytic Completeness of Sets
of Postulates”, Proceedings of the London Mathematical
Society, second series 25: 115–142.
doi:10.1112/plms/s2-25.1.115 (Scholar)
- –––, 1927, “Theorems on Deducibility
(Second Paper)”, Annals of Mathematics, second series
28(1/4): 459–471. doi:10.2307/1968390 (Scholar)
- Langton, Christopher G., 1989, “Artificial Life”, in
Artificial Life: The Proceedings of An Interdisciplinary Workshop
on the Synthesis and Simulation of Living Systems, Held September,
1987 in Los Alamos, New Mexico, Christopher G. Langton (ed.),
Redwood City, CA: Addison-Wesley, 1–47. (Scholar)
- Leibniz, Gottfried Wilhelm, 1666 [2020], Dissertatio de Arte
Combinatoria, Leipzig. Translated in Leibniz: Dissertation on
Combinatorial Art, Massimo Mugnai, Han van Ruler, and Martin
Wilson (eds), Oxford: Oxford University Press, 2020. (Scholar)
- –––, 1671 [1926], letter to Herzog, October(?)
1671, in Erich Hochstetter, Willy Kabitz and Paul Ritter (eds),
Gottfried Wilhelm Leibniz: Sämtliche Schriften und
Briefe, second series: Philosophischer Briefwechsel
(Volume 1), 1663–1685, Darmstadt: O. Reichl, 1926:
159–165 (facsimile of the 1926 edition, Hildesheim: G. Olms,
1972). (Scholar)
- –––, 1679 [1903], “Consilium de
Encyclopaedia Nova Conscribenda Methodo Inventoria”, in Couturat
1903: 30–41. (Scholar)
- –––, 1685 [1951], “L’Art
d’Inventer”, in Couturat 1903. Translated as “The
Art of Discovery” in Philip P. Wiener (ed.),Leibniz
Selections, New York: Scribner, 1951: 50–58. (Scholar)
- –––, 1710, “Brevis descriptio machinae
arithmeticae, cum figura”, in Miscellanea Berolinensia
ad incrementum scientiarum, pp. 317–19 (and Fig. 73),
Berlin: Johann Christoph Papenius. (Scholar)
- –––, 1714 [1969], letter to Remond, 10 January
1714, in Leroy E. Loemker (ed.), Gottfried Wilhelm Leibniz:
Philosophical Papers and Letters, second edition, Dordrecht:
Reidel, 1969: 654–655. (Scholar)
- –––, n.d.1 [1903], “De Machina
Combinatoria”, in Couturat 1903: 572. (Scholar)
- –––, n.d.2 [1890], “Discours
touchant la methode de la certitude et l’art d’inventer
pour finir les disputes et pour faire en peu de temps des grands
progrés”, in Carl J. Gerhardt (ed.), Die
philosophischen Schriften von Gottfried Wilhelm Leibniz (Volume
7), Berlin, 1890: 174–183 (facsimile of the 1890 edition,
Hildesheim: G. Olms, 1965). (Scholar)
- Lewis, Harry R. and Christos H. Papadimitriou, 1981, Elements of the Theory of Computation, Englewood Cliffs, NJ: Prentice-Hall. (Scholar)
- Llull, Ramon, 1645 [1970], Ars Generalis Ultima, Palma Malorca, facsimile of the 1645 edition, Frankfurt: Minerva, 1970. (Scholar)
- –––, 1986, Poesies, Josep Romeu i
Figueras (ed.), Barcelona: Enciclopèdia Catalana. (Scholar)
- Löwenheim, Leopold, 1915, “Über Möglichkeiten
im Relativkalkül”, Mathematische Annalen, 76(4):
447–470. doi:10.1007/bf01458217 (Scholar)
- MacLennan, Bruce J., 2003, “Transcending Turing Computability”, Minds and Machines, 13(1): 3–22. doi:10.1023/a:1021397712328 (Scholar)
- Mancosu, Paolo and Richard Zach, 2015, “Heinrich Behmann’s 1921 Lecture on the Decision Problem and the Algebra of Logic”, Bulletin of Symbolic Logic, 21(2): 164–187. doi:10.1017/bsl.2015.10 (Scholar)
- Markov, Andrey A., 1951,
“Теория
Алгорифмов”,
Trudy Matematicheskogo Instituta imeni V. A. Steklova, 38:
176–189. Translation by Edwin Hewitt, 1960, “The Theory of
Algorithms”, American Mathematical Society
Translations, Series 2, 15: 1–14.
- Marquand, Allan, 1881, “On Logical Diagrams for n
Terms”, The London, Edinburgh, and Dublin Philosophical
Magazine and Journal of Science, fifth series, 12(75):
266–270. doi:10.1080/14786448108627104 (Scholar)
- –––, 1883, “A Machine for Producing
Syllogistic Variations”, in Studies in Logic, Charles
S. Peirce (ed.), Boston: Little, Brown, 12–15.
doi:10.1037/12811-002 (Scholar)
- –––, 1885, “A New Logical Machine”, Proceedings of the American Academy of Arts and Sciences, 21: 303–307. (Scholar)
- Massey, Gerald J., 1966, “An Extension of Venn Diagrams”, Notre Dame Journal of Formal Logic, 7(3): 239–250. doi:10.1305/ndjfl/1093958619 (Scholar)
- Mays, Wolfe and Desmond P. Henry, 1951, “Logical Machines:
New Light on W. Stanley Jevons”, Manchester Guardian,
no. 32677 (14 July 1951) B, 4. (Scholar)
- –––, 1953, “Jevons and Logic”, Mind, 62(248): 484–505. doi:10.1093/mind/lxii.248.484 (Scholar)
- Mays, W. and Dietrich G. Prinz, 1950, “A Relay Machine for
the Demonstration of Symbolic Logic”, Nature,
165(4188): 197–198. doi:10.1038/165197a0 (Scholar)
- Mendelson, Elliott, 1963, “On Some Recent Criticism of Church’s Thesis.”, Notre Dame Journal of Formal Logic, 4(3): 201–205. doi:10.1305/ndjfl/1093957577 (Scholar)
- –––, 1964, Introduction to Mathematical Logic, Princeton, NJ: Van Nostrand. (Scholar)
- –––, 1990, “Second Thoughts about Church’s Thesis and Mathematical Proofs”, The Journal of Philosophy, 87(5): 225–233. doi:10.2307/2026831 (Scholar)
- Montague, Richard, 1960, “Towards a General Theory of Computability”, Synthese, 12(4): 429–438. doi:10.1007/bf00485427 (Scholar)
- Németi, István and Gyula Dávid, 2006, “Relativistic Computers and the Turing Barrier”, Applied Mathematics and Computation, 178(1): 118–142. doi:10.1016/j.amc.2005.09.075 (Scholar)
- Newell, Allen, 1980, “Physical Symbol Systems”, Cognitive Science, 4(2): 135–183. doi:10.1207/s15516709cog0402_2 (Scholar)
- Newman, Maxwell H.A., 1923, “The Foundations of Mathematics
from the Standpoint of Physics”, fellowship dissertation, in the
Records of St John’s College, Cambridge, SJCR/SJAC/2/1/5/1
(quoted by permission of the Master and Fellows of St
John’s). (Scholar)
- –––, 1955, “Alan Mathison Turing,
1912–1954”, Biographical Memoirs of Fellows of the
Royal Society, 1(November): 253–263.
doi:10.1098/rsbm.1955.0019 (Scholar)
- –––, c1977, Newman in interview with
Christopher Evans, n.d., “The Pioneers of Computing: An
Oral History of Computing”, London: Science Museum;
transcription by Copeland in Copeland 2004: 206. (Scholar)
- Olszewski, Adam, Jan Woleński, and Robert Janusz (eds), 2006, Church’s Thesis after 70 Years, Frankfurt/New Brunswick, NJ: Ontos. doi:10.1515/9783110325461 (Scholar)
- Peirce, Charles S., 1886, letter to Marquand, 30 December 1886, in
Peirce 1993: item 58, pp. 422–424. (Scholar)
- –––, 1887, “Logical Machines”,
The American Journal of Psychology, 1(1): 165–170. (Scholar)
- –––, 1903a, “The 1903 Lowell Institute
Lectures I–V”, in Peirce 2021: 137–310. (Scholar)
- –––, 1903b, R S32, draft of last part of the 2nd
Lowell Lecture, in Peirce 2021.
- –––, 1903c, R 462, 2nd draft of the 3rd Lowell
Lecture, in Peirce 2021.
- –––, 1903d, R 464, 3rd draft of the 3rd Lowell
Lecture, in Peirce 2021.
- –––, n.d., R 831, untitled, Charles S.
Peirce Papers, Houghton Library, Harvard.
- –––, 1908, “Some Amazing Mazes
(conclusion)”, Monist, 18(3): 416–464.
doi:10.5840/monist190818326 (Scholar)
- –––, 1993, Writings of Charles S. Peirce: A
Chronological Edition, Volume 5: 1884–1886, Christian J.W.
Kloesel (ed.), Bloomington, IN: Indiana University Press. (Scholar)
- –––, 2021, Charles S. Peirce: Logic of the
Future, Writings on the Existential Graphs, Volume 2/2: The 1903
Lowell Lectures, Ahti-Veikko Pietarinen (ed.), Berlin: de
Gruyter. (Scholar)
- Penrose, Roger, 1994, Shadows of the Mind: A Search for the Missing Science of Consciousness, Oxford/New York: Oxford University Press. (Scholar)
- –––, 2011, “Gödel, the Mind, and the Laws of Physics”, in Kurt Gödel and the Foundations of Mathematics, Matthias Baaz, Christos H. Papadimitriou, Hilary W. Putnam, Dana S. Scott, and Charles L. Harper, Jr (eds), Cambridge: Cambridge University Press, 339–358. doi:10.1017/cbo9780511974236.019 (Scholar)
- –––, 2016, “On Attempting to Model the
Mathematical Mind”, in The Once and Future Turing: Computing
the World, S. Barry Cooper and Andrew Hodges (eds), Cambridge:
Cambridge University Press, 361–378.
doi:10.1017/cbo9780511863196.022 (Scholar)
- Péter, Rózsa, 1935, “Über den
Zusammenhang der verschiedenen Begriffe der rekursiven
Funktion”, Mathematische Annalen, 110(1):
612–632. doi:10.1007/bf01448046 (Scholar)
- Pitowski, Itamar, 1990, “The Physical Church Thesis and Physical Computational Complexity”, Iyyun, 39: 81–99. (Scholar)
- Post, Emil L., 1936, “Finite Combinatory Processes—Formulation 1”, The Journal of Symbolic Logic, 1(3): 103–105. doi:10.2307/2269031 (Scholar)
- –––, 1943, “Formal Reductions of the
General Combinatorial Decision Problem”, American Journal of
Mathematics, 65(2): 197–215. doi:10.2307/2371809 (Scholar)
- –––, 1946, “A Variant of a Recursively
Unsolvable Problem”, Bulletin of the American Mathematical
Society, 52(4): 264–268.
doi:10.1090/s0002-9904-1946-08555-9 (Scholar)
- –––, 1965, “Absolutely Unsolvable Problems
and Relatively Undecidable Propositions—Account of an
Anticipation”, in Davis 1965: 340–433. (Scholar)
- Pour-El, Marian Boykan and Ian Richards, 1979, “A Computable Ordinary Differential Equation Which Possesses No Computable Solution”, Annals of Mathematical Logic, 17(1–2): 61–90. doi:10.1016/0003-4843(79)90021-4 (Scholar)
- –––, 1981, “The Wave Equation with
Computable Initial Data Such That Its Unique Solution Is Not
Computable”, Advances in Mathematics, 39(3):
215–239. doi:10.1016/0001-8708(81)90001-3 (Scholar)
- –––, 1989, Computability in Analysis and
Physics, Berlin: Springer.
[Pour-El and Richards 1989 available online] (Scholar)
- Quine, Willard Van Orman, 1950, Methods of Logic, New York: Holt. (Scholar)
- –––, 1951, Mathematical Logic, revised edition, Cambridge, MA: Harvard University Press. (Scholar)
- Rabin, Michael O. and Dana S. Scott, 1959, “Finite Automata
and Their Decision Problems”, IBM Journal of Research and
Development, 3(2): 114–125. doi:10.1147/rd.32.0114 (Scholar)
- Ramsey, Frank P., 1930, “On a Problem of Formal
Logic”, Proceedings of the London Mathematical Society,
second series 30(1): 264–286. doi:10.1112/plms/s2-30.1.264 (Scholar)
- Roberts, Don D., 1973, The Existential Graphs of Charles S. Peirce, Hague: Mouton. (Scholar)
- –––, 1997, “A Decision Method for
Existential Graphs”, in Houser, Roberts, & Van Evra 1997:
387–401. (Scholar)
- Rosser, J. Barkley, 1935a, “A Mathematical Logic Without
Variables. I”, Annals of Mathematics, second series
36(1): 127–150. doi:10.2307/1968669 (Scholar)
- –––, 1935b, “A Mathematical Logic without
Variables. II”, Duke Mathematical Journal, 1(3):
328–355. doi:10.1215/s0012-7094-35-00123-5 (Scholar)
- Scarpellini, Bruno, 1963, “Zwei Unentscheidbare Probleme Der Analysis”, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 9(18–20): 265–289. doi:10.1002/malq.19630091802 (Scholar)
- –––, 2003, “Comments on ‘Two Undecidable Problems of Analysis’”, Minds and Machines, 13(1): 79–85. doi:10.1023/a:1021364916624 (Scholar)
- Schiemer, Georg, Richard Zach, and Erich Reck, 2017, “Carnap’s Early Metatheory: Scope and Limits”, Synthese, 194(1): 33–65. doi:10.1007/s11229-015-0877-z (Scholar)
- Schmidhuber, Jürgen, 2012, “Turing in Context”,
Science, 336(6089): 1638–1639.
doi:10.1126/science.336.6089.1638-c (Scholar)
- Schönfinkel, Moses, 192?, “Zum Entscheidungsproblem der
mathematischen Logik”, n.d., Heft I, Bernays
Papers, ETH Zurich (Hs 974.282). (Scholar)
- –––, 1924, “Über die Bausteine der
mathematischen Logik”, Mathematische Annalen,
92(3–4): 305–316. doi:10.1007/bf01448013 (Scholar)
- Searle, John R., 1992, The Rediscovery of the Mind, Cambridge, MA: MIT Press. (Scholar)
- Shagrir, Oron, 2002, “Effective Computation by Humans and Machines”, Minds and Machines, 12(2): 221–240. doi:10.1023/a:1015694932257 (Scholar)
- –––, 2006, “Gödel on Turing on Computability”, in Olszewski, Wolenski, and Janusz 2006: 393–419. doi:10.1515/9783110325461.393 (Scholar)
- Shagrir, Oron and Itamar Pitowsky, 2003, “Physical Hypercomputation and the Church–Turing Thesis”, Minds and Machines, 13(1): 87–101. doi:10.1023/a:1021365222692 (Scholar)
- Shepherdson, John C. and Howard E. Sturgis, 1963,
“Computability of Recursive Functions”, Journal of the
ACM, 10(2): 217–255. doi:10.1145/321160.321170 (Scholar)
- Shoenfield, Joseph R., 1993, Recursion Theory, Berlin/New
York: Springer. (Scholar)
- Sieg, Wilfried, 1994, “Mechanical Procedures and Mathematical Experience”, in Mathematics and Mind, Alexander George (ed.), Oxford: Oxford University Press: 71–117. (Scholar)
- –––, 2002, “Calculations by Man and Machine: Conceptual Analysis”, in Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, Wilfried Sieg, Richard Sommer, and Carolyn Talcott (eds), Urbana, IL: Association for Symbolic Logic, 390–409. (Scholar)
- –––, 2008, “Church Without Dogma: Axioms
for Computability”, in New Computational Paradigms, S.
Barry Cooper, Benedikt Löwe, and Andrea Sorbi (eds), New York,
NY: Springer New York, 139–152.
doi:10.1007/978-0-387-68546-5_7 (Scholar)
- Siegelmann, Hava T., 2003, “Neural and Super-Turing Computing”, Minds and Machines, 13(1): 103–114. doi:10.1023/a:1021376718708 (Scholar)
- Siegelmann, Hava T. and Eduardo D. Sontag, 1992, “On the
Computational Power of Neural Nets”, in Proceedings of the
Fifth Annual Workshop on Computational Learning Theory - COLT
’92, Pittsburgh, PA: ACM Press, 440–449.
doi:10.1145/130385.130432 (Scholar)
- –––, 1994, “Analog Computation via Neural
Networks”, Theoretical Computer Science, 131(2):
331–360. doi:10.1016/0304-3975(94)90178-3 (Scholar)
- Skolem, Thoralf, 1923, “Begründung der elementaren
Arithmetik”, Videnskapsselskapets Skrifter, I.
Matematisk-naturvidenskabelig Klasse, 6: 3–38. (Scholar)
- Smithies, Frank, 1934, “Foundations of Mathematics. Mr.
Newman”, lecture notes, St John’s College Library,
Cambridge, GB 275 Smithies/H/H57. (Scholar)
- Stannett, Mike, 1990, “X-Machines and the Halting Problem:
Building a Super-Turing Machine”, Formal Aspects of
Computing, 2(1): 331–341. doi:10.1007/bf01888233 (Scholar)
- Stewart, Ian, 1991, “Deciding the Undecidable”,
Nature, 352(6337): 664–665. doi:10.1038/352664a0 (Scholar)
- Stjernfelt, Frederik, 2022, Sheets, Diagrams, and Realism in Peirce, Berlin: De Gruyter. doi:10.1515/9783110793628 (Scholar)
- Syropoulos, Apostolos, 2008, Hypercomputation: Computing beyond the Church-Turing Barrier, New York: Springer. doi:10.1007/978-0-387-49970-3 (Scholar)
- Turing, Alan M., 1936 [2004], “On Computable Numbers, with
an Application to the Entscheidungsproblem”, Proceedings of
the London Mathematical Society, 1936, second series, 42(1):
230–265. Reprinted in Copeland 2004: 58–90 (ch. 1).
doi:10.1112/plms/s2-42.1.230 (Scholar)
- –––, 1937, “Computability and λ-Definability”, The Journal of Symbolic Logic, 2(4): 153–163. doi:10.2307/2268280 (Scholar)
- –––, 1939 [2004], “Systems of Logic Based
on Ordinals”, Proceedings of the London Mathematical
Society, second series, 45(1): 161–228. Reprinted in
Copeland 2004: 146–204 (ch. 3).
doi:10.1112/plms/s2-45.1.161 (Scholar)
- –––, c.1940 [2004], letter to Newman, n.d., in
Copeland 2004: 214–216 (ch. 4). (Scholar)
- –––, 1945 [2005], “Proposed Electronic
Calculator”, National Physical Laboratory Report, in Copeland
2005: 369–454 (ch. 20).
doi:10.1093/acprof:oso/9780198565932.003.0021 (Scholar)
- –––, 1947 [2004], “Lecture on the
Automatic Computing Engine”, London Mathematical Society, in
Copeland 2004: 378–394 (ch. 9). (Scholar)
- –––, 1948 [2004], “Intelligent
Machinery”, National Physical Laboratory Report, in Copeland
2004: 410–432 (ch. 10). (Scholar)
- –––, 1950a [2004], “Computing Machinery
and Intelligence”, Mind, 59(236): 433–460.
Reprinted in Copeland 2004: 441–464 (ch. 11).
doi:10.1093/mind/LIX.236.433 (Scholar)
- –––, 1950b, “The Word Problem in
Semi-Groups With Cancellation”, Annals of Mathematics,
second series 52(2): 491–505. doi:10.2307/1969481 (Scholar)
- –––, c.1950, Programmers’ Handbook for
Manchester Electronic Computer Mark II, Computing Machine
Laboratory, University of Manchester.
[Turing c.1950 available online] (Scholar)
- –––, 1954 [2004], “Solvable and Unsolvable
Problems”, Science News (Penguin Books), 31:
7–23. Reprinted in Copeland 2004: 582–595 (ch. 17). (Scholar)
- van Heijenoort, Jean, 1967, From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931, Cambridge, MA: Harvard University Press. (Scholar)
- Venn, John, 1880, “On the Diagrammatic and Mechanical Representation of Propositions and Reasonings”, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, fifth series, 10(59): 1–18. doi:10.1080/14786448008626877 (Scholar)
- von Neumann, John, 1927, “Zur Hilbertschen
Beweistheorie”, Mathematische Zeitschrift, 26(1):
1–46. doi:10.1007/bf01475439 (Scholar)
- –––, 1931, “Die formalistische Grundlegung der Mathematik”, Erkenntnis, 2(1): 116–121. doi:10.1007/bf02028144 (Scholar)
- Wang, Hao, 1974, From Mathematics to Philosophy, New York: Humanities Press. (Scholar)
- –––, 1996, A Logical Journey: From Gödel to Philosophy, Cambridge, MA: MIT Press. (Scholar)
- Weyl, Hermann, 1927 [1949], “Philosophie der Mathematik und
Naturwissenschaft”, Handbuch der Philosophie, Munich:
Oldenbourg. Published in English as Philosophy of Mathematics and
Natural Science, Princeton, NJ: Princeton University Press,
1949. (Scholar)
- Wittgenstein, Ludwig, 1947 [1980], Bemerkungen über die
Philosophie der Psychologie. Translated as Remarks on the
Philosophy of Psychology, Volume 1, Anscombe, G. Elizabeth M. and
Georg Henrik von Wright (eds), Oxford: Blackwell, 1980. (Scholar)
- Wolfram, Stephen, 1985, “Undecidability and Intractability
in Theoretical Physics”, Physical Review Letters,
54(8): 735–738. doi:10.1103/physrevlett.54.735 (Scholar)
- –––, 2021, Combinators: A Centennial
View, Champaign, IL: Wolfram Media. (Scholar)
- Yao, Andrew C.-C., 2003, “Classical Physics and the
Church-Turing Thesis”, Journal of the ACM, 50(1):
100–105. doi:10.1145/602382.602411 (Scholar)
- Zach, Richard, 1999, “Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic”, Bulletin of Symbolic Logic, 5(3): 331–366. doi:10.2307/421184 (Scholar)
- –––, 2003, “The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert’s Program”, Synthese, 137(1/2): 211–259. doi:10.1023/a:1026247421383 (Scholar)
- Zanichelli, Nicola (ed.), 1929, Atti del Congresso
Internazionale dei Matematici, Bologna, 3–10 Settembre 1928,
Volume 1: Rendiconto del Congresso Conferenze, Bologna:
Società Tipografica. (Scholar)