A natural axiomatization of computability and proof of church's thesis

Bulletin of Symbolic Logic

Volumn 14, Issue 3, 2008, Pages 299-350

  Dershowitz, Nachum ^a,b   Gurevich, Yuri ^a  

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Abstract state machines; Algorithms; Church's thesis; Computable functions; Effective computation; Encodings; Recursiveness; Turing's thesis

Indexed keywords

EID: 52049125054     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1231081370     Document Type: Article

References (113)

1. ALLIANCE FOR TELECOMMUNICATIONS INDUSTRY SOLUTIONS, COMMITTEE T1A1 PERFORMANCE AND SIGNAL PROCESSING, ATIS Telecom Glossary 2000, American National Standards Institute Document ANS T1.523-2001, approved 28 February 2001. Latest version available athttp://www.atis.org/glossary/definition.aspx? id=7687 (viewed Apr. 23, 2008).
2. HENK BARENDREGT, The impact of the lambda calculus in logic and computer science, this BULLETIN, vol. 3 (1997), no. 2, pp. 181-215, available at http://www.math.ucla.edu/∼asl/bsl/0302/0302-003. ps (viewed Apr. 21, 2008).
3. JANIS M. BARZDIN, Ob odnom klasse mashin Tjuringa (mashiny Minskogo) [On a class of Turing machines (Minsky machines)], Algebra i Logika [Algebra and Logic], vol. 1 (1963), no. 6, pp. 42-51, in Russian.
4. HEINRICH BEHMANN, Beitrage zur Algebra der Logik, insbesondere zum Entscheidungs-problem, Mathematische Annalen, vol. 86 (1922), pp. 163-229, in German.
5. JAN A. BERGSTRA and JOHN V. TUCKER, Algebraic specifications of computable and semi-computable datastructures, Theoretical Computer Science, vol. 50 (1987), no. 2, pp. 137-181.
6. ROBERT BLACK, Proving Church's thesis, Philosophia Mathematica, vol. 8 (2000), pp. 244-258.
7. ANDREAS BLASS, NACHUM DERSHOWITZ, and YURI GUREVICH, When are two algorithms the samel?, Technical Report MSR-TR-2008-20, Microsoft Research, Redmond, WA, February 2008, available at http://research.microsoft.com/∼gurevich/Opera/192.pdf (viewed Apr. 30, 2008).
8. ANDREAS BLASS and YURI GUREVICH, Algorithms vs. machines, Bulletin of the European Association for Theoretical Computer Science, (2002), no. 77, pp. 96-118, reprinted in Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. 2, Formal Models and Semantics (G. Paun, G. Rozenberg, and A. Salomaa, editors), World Scientific Publishing Company, 2004, pp. 215-236. Available at http://research.microsoft.com/∼gurevich/Opera/158. pdf (viewed Nov. 28, 2007).
9. Abstract state machines capture parallel algorithms, ACM Transactions on Computational Logic, vol. 4 (2003), no. 4, pp. 578-651, available at http://research.microsoft.com/∼gurevich/Opera/157-1.pdf (viewed Nov. 28, 2007). See also: Abstract state machines capture parallel algorithms: Correction and extension, ACM Transactions on Computational Logic, vol. 9, no. 3, in press, available at http://tocl.acm.org/accepted/ 314gurevich.pdf (viewed Nov. 28, 2007).
10. Algorithms: A quest for absolute definitions, Church's Thesis after 70 years (A. Olszewski, J. Wolenski, and R. Janusz, editors), Ontos Verlag, 2006, pp. 24-57. Also in Bulletin of the European Association for Theoretical Computer Science, (2003), no. 81, pp. 195-225, and in Current trends in theoretical computer science, World Scientific, 2004, pp. 283-311, available at http://research.microsoft.com/∼gurevich/Opera/ 164.pdf (viewed Nov. 28, 2007).
11. Ordinary interactive small-step algorithms, I, ACM Transactions on Computational Logic, vol. 7 (2006), no. 2, pp. 363-419, available at http://tocl.acm.org/accepted/blass04.ps (viewed Apr. 23, 2008).
12. Ordinary interactive small-step algorithms, II, ACM Transactions on Computational Logic, vol. 8 (2007), no. 3, available at http://tocl.acm.org/accepted/blass2.ps (viewed Apr. 23, 2008).
13. Ordinary interactive small-step algorithms, III, ACM Transactions on Computational Logic, vol. 8 (2007), no. 3, available at http://tocl.acm.org/accepted/250blass.pdf (viewed Apr. 23, 2008).
14. Why sets?, Pillars of computer science: Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday (A. Avron, N. Dershowitz, and A. Rabinovich, editors), Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin. 2008, pp. 179-198, available at http://research.microsoft.com/∼gurevich/Opera/172.pdf (viewed Mar. 8, 2008).
15. ANDREAS BLASS, YURI GUREVICH, DEAN ROSENZWEIG, and BENJAMIN ROSSMAN. Interactive small-step algorithms I: Axiomatization, Logical Methods in Computer Science, vol. 3 (2007), no. 4, available at http://research.microsoft.com/∼gurevich/Opera/176.pdf (viewed Dec. 16, 2007).
16. Interactive small-step algorithms II: Abstract state machines and the characterization theorem, Logical Methods in Computer Science, vol. 3 (2007), no. 4, available at http://research.microsoft.com/∼gurevich/ Opera/182.pdf (viewed Dec. 16, 2007).
17. UDI BOKER and NACHUM DERSHOWTTZ, Abstract effective models, New developments in computational models: Proceedings of the first international workshop on Developments in Computational Models (DCM 2005) (Lisbon, Portugal, July 2005) (M. Fernández and I. Mackie, editors), vol. 135, Electronic Notes in Theoretical Computer Science, no. 3, February 2006, pp. 15-23, available at http://www.cs.tau.ac.il/∼nachum/papers/AbstractEffectiveModels.pdf (viewed Nov. 28, 2007).
18. Comparing computational power, Logic Journal of the IGPL, vol. 14 (2006), no. 5, pp. 633-648, available at http://www.cs.tau.ac.il/ ∼nachum/papers/ComparingComputationalPower.pdf (viewed Nov. 28, 2007).
19. The Church-Turing Thesis over arbitrary domains, Pillars of computer science: Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday (A. Avron, N. Dershowitz, and A. Rabinovich, editors), Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin, 2008, pp. 199-229, available at http://www.cs.tau.ac.il/∼nachum/papers/ ArbitraryDomains.pdf (viewedNov. 28, 2007).
20. EGON BORGER, The origins and the development of the ASM method for high level system design and analysis, Journal of Universal Computer Science, vol. 8 (2002), no. 1, pp. 2-74.
21. SAMUEL R. BUSS, ALEXANDER A. KECHRIS, ANAND PILLAY, and RICHARD A. SHORE, The prospects for mathematical logic in the twenty-first century, this BULLETIN, vol. 7 (2001), no. 2, pp. 169-196, available at http://www.math.ucla.edu/∼asl/bsl/0702/0702-001.ps (viewed Apr. 21, 2008).
22. ALONZO CHURCH, A note on the Entscheidungsproblem, The Journal of Symbolic Logic, vol. 1 (1936), no. 1, pp. 40-41; Corrigendum, The Journal of Symbolic Logic, vol. 1 (1936), no. 3, pp. 101-102. Reprinted in [27], pp. 110-115.
23. An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58 (1936), pp. 345-363, reprinted in [27], pp. 89-107. Available at doi: 10.2307/2371045.
24. Review of Alan M. Turing, On computable numbers, with an application to the Entscheidungsproblem (Proceedings of the London Mathematical Society, vol. 2 (1936). no. 42, pp. 230-265), The Journal of Symbolic Logic, vol. 2 (1937), pp. 42-43.
25. Review of Emil Post, Finite combinatory processes, Formulation I (The Journal of Symbolic Logic, vol. 1 (1936). pp. 103-105). The Journal of Symbolic Logic, vol. 2 (1937). p. 43.
26. B. JACK COPELAND, The Church-Turing Thesis, Stanford encyclopedia of philosophy (E. Zalta, editor), 1996, available at http://plato.stanford.edu/entries/church-turing (viewed Nov. 28, 2007).
27. Martin Davis (editor), The undecidable: Basic papers on undecidable propositions, unsolvable problems and computable functions, Raven Press, Hewlett, NY, 1965, reprinted by Dover Publications, Mineola, NY, 2004.
28. Why Gödel didn't have Church's thesis, Information and Control, vol. 54 (1982), pp. 3-24.
29. MARTIN D. DAVIS, RON SIGAL, and ELAINE J. WEYUKER, Computability, complexity, and languages: Fundamentals of theoretical computer science, 2nd ed., Academic Press, San Diego, CA, 1994.
30. ANUJ DAWAR, DAVID RICHERBY, and BENJAMIN ROSSMAN, Choicelesspolynomial time, counting and the Cai-Fürer-Immerman graphs, Annals of Pure and Applied Logic, vol. 152 (2008), pp. 31-50, available at http://www.mit.edu/ ∼brossman/CPT-CFI.pdf (viewed Apr. 30, 2008).
31. JANET FOLINA, Church's thesis: Prelude to a proof, Philosophia Mathematica, vol. 6 (1998), no. 3, pp. 302-323.
32. EDWARD F. FREDKIN and TOMMASO TOFFOLI, Conservative logic, International Journal of Theoretical Physics, vol. 21 (1982), no. 3/4, pp. 219-253.
33. HARVEY M. FRIEDMAN, Mathematical logic in the 20th and 21st centuries, FOM - Foundations of Mathematics mailing list, April 27 2000, available at http://cs.nyu.edu/pipermail/fom/ 2000-April/003913.html (viewed Mar. 27, 2008).
34. ALBRECHT FRÖHLICH and JOHN C. SHEPHERDSON, Effective procedures infield theory, Philosophical transactions of the Royal Society of London, Series A, vol. 248 (1956), pp. 407-432.
35. ROBIN O. GANDY, Church's Thesis and principles for mechanisms, The Kleene symposium (J. Barwise, D. Kaplan, H. J. Keisler, P. Suppes, and A. S. Troelstra, editors), Studies in Logic and the Foundations of Mathematics, vol. 101, North-Holland, Amsterdam, 1980, pp. 123-148.
36. The confluence of ideas in 1936, The universal Turing machine: A half-century survey (R. Herken, editor), Oxford University Press, New York, 1988, pp. 55-111.
37. ANDREAS GLAUSCH and WOLFGANG REISIG, An ASM-characterization of a class of distributed algorithms, Proceedings of the Dagstuhl seminar on rigorous methods for software construction and analysis (J.-R. Abrial and U. Classer, editors), May 2006, available at http://www2.informatik.hu-berlin.de/top/download/publications/ GlauschR2007_dagstuhl.pdf (viewed Mar. 26, 2008). Longer version: Distributed abstract state machines and their expressive power, Informatik- Berichte 196, Humboldt-Universität zu Berlin, Jan. 2006, available at http://www2.informatik.hu-berlin.de/top/download/publications/ GlauschR2006_hub-tr196.pdf (viewed Mar. 26, 2008).
38. KURT GÖDEL, On undecidable propositions of formal mathematical systems, in [27], pp. 41-73, based on lecture notes from 1934.
39. Gödel * 193?: [Undecidable diophantine propositions], Unpublished essays and lectures, Kurt Gödel: Collected works (S. Feferman, J. W. Dawson, Jr., W. Goldfarb, C. Parsons, and R. N. Solovay, editors), vol. III, Oxford University Press, Oxford, 1995, pp. 164-174.
40. E. MARK GOLD, Limiting recursion, The Journal of Symbolic Logic, vol. 30 (1965), no. 1, pp. 28-48.
41. YURI GUREVICH, Evolving algebras 1993: Lipari guide, Specification and validation methods (E. Börger, editor), Oxford University Press, Oxford, 1995, available at http://research.microsoft.com/∼gurevich/Opera/103.pdf (viewedNov. 28, 2007), pp. 9-36.
42. Sequential abstract state machines capture sequential algorithms, ACM Transactions on Computational Logic, vol. 1 (2000), no. 1, pp. 77-111, available at http://tocl.acm.org/accepted/gurevich.ps (viewed Apr. 23, 2008).
43. YURI GUREVICH and JAMES K. HUGGINS, The semantics of the C programming language, Proceedings of the sixth workshop on Computer Science Logic (CSL '92) (Berlin), Lecture Notes in Computer Science, vol. 702, Springer-Verlag, 1993, pp. 274-308, 334-336, available at http://research.microsoft.com/∼gurevich/Opera/98.pdf (viewed Mar. 13, 2008).
44. DAVID HILBERT, Mathematische Probleme: Vortrag, gehalten auf dem internationalen Mathematiker-Kongreß zu Paris 1900, in German, available at http://www.mathematik.uni-bielefeld.de/∼kersten/ hilbert/rede.html (viewed Nov. 28, 2007).
45. DAVID HILBERT and WILHELM ACKERMANN, Grundzüge der theoretischen Logik, Springer-Verlag, Berlin, 1928, in German. English version of the second (1938) edition: Principles of theoretical logic (R. E. Luce, translator and editor), AMS Chelsea Publishing, New York, 1950.
46. LÁSZLÓ KALMÁR, An argument against the plausibility of Church's thesis, Constructivity in mathematics (A. Heyting, editor), North-Holland, Amsterdam, 1959, pp. 201-205.
47. SHEN KANGSHEN, JOHN N. CROSSLEY, and ANTHONY W. C. LUN, The nine chapters on the mathematical art: Companion and commentary, Oxford University Press, Oxford, 1999.
48. STEPHEN C. KLEENE, Recursive predicates and quantifiers, Transactions of the American Mathematical Society, vol. 53 (1943), no. 1, pp. 41-73, reprinted in [27], pp. 255-287.
49. Introduction to metamathematics, D. Van Nostrand, New York, 1952.
50. Mathematical logic, John Wiley, New York, 1967, reprinted by Dover, Mineola, NY, 2002.
51. Origins of recursive function theory, IEEE Annals of the History of Computing, vol. 3 (1981), no. 1, pp. 52-67, preliminary version in Proceedings of the 20th annual IEEE symposium on Foundations of Computer Science (FOCS), San Juan, PR, Oct. 1979, pp. 371-382.
52. Reflections on Church's thesis, Notre Dame Journal of Formal Logic, vol. 28 (1987), no. 4, pp. 490-498.
53. Turing's analysis of computability, and major applications of it, The universal Turing machine: A half-century survey (R. Herken, editor), Oxford University Press, New York, 1988, pp. 17-54.
54. DONALD E. KNUTH, Algorithm and program; information and data, Communications of the ACM, vol. 9 (1966), no. 9, p. 654.
55. Fundamental algorithms, The art of computer programming, vol. 1, Addison-Wesley, Reading, MA, 3rd ed., 1997.
56. ANDREǏ N. KOLMOGOROV, Oponyatii algoritma [On the concept of algorithm], Uspekhi Matematicheskikh Nauk [Russian Mathematical Surveys], vol. 8 (1953), no. 4, pp. 175-176, in Russian. English version in [111, pp. 18-19].
57. ANDREǏ N. KOLMOGOROV and VLADIMIR A. USPENSKY, K opredeleniu algoritma, Uspekhi Matematicheskikh Nauk [Russian Mathematical Surveys], vol. 13 ( 1958), no. 4, pp. 3-28, in Russian. English version: On the definition of an algorithm, American Mathematical Society Translations, Series II, vol. 29, 1963, pp. 217-245.
58. GEORG KREISEL, Mathematical logic, Lectures in modern mathematics III (T. L. Saaty, editor), Wiley and Sons, New York, 1965, pp. 95-195.
59. Mathematical logic: What has it done for the philosophy of mathematics, Bertrand Russell: Philosopher of the century (R. Schoenman, editor), Allen & Unwin, London, 1967, pp. 201-272.
60. SAUL KRIPKE, Elementary recursion theory and its applications to formal systems, unpublished preliminary draft, 1996.
61. From the Church-Turing thesis to the first-order algorithm theorem, Proceedings of the 15th annual IEEE symposium on Logic in Computer Science, Santa Barbara, CA, June 2000, p. 177. Recorded lecture at http://www.vanleer.org.il/eng/videoShow.asp?id=317 (viewed Mar. 28, 2008).
62. WILLIAM M. LAMBERT, JR., A notion of effectiveness in arbitrary structures, The Journal of Symbolic Logic, vol. 33 (1968), no. 4, pp. 577-602.
63. JOHN R. LUCAS, Review of Judson C. Webb, Mechanism, mentalism and metamathematics: An essay on finitism (D. Reidel, Dordrecht, 1980), The British Journal for the Philosophy of Science, vol. 33 (1982), no. 4, pp. 441-444.
64. ANATOLIǏ I. MAL'CEV, Konsfruktivnyye algyebry. 1, Uspekhi Matematicheskikh Nauk, vol. 16 (1961), no. 3, pp. 3-60. English version: Constructive algebras, I, The metamathematics of algebraic systems (K. A. Hirsch, translator), Russian Mathematical Surveys, vol. 16 (1961), no. 3, pp. 77-129. Also in: The metamathematics of algebraic systems. Collected papers 1936-1967, B. F. Wells, III, editor, North-Holland, Amsterdam, 1971, pp. 148-212.
65. ZOHAR MANNA and ADI SHAMIR, The optimal approach to recursive programs, Communications of the ACM, vol. 20 (1977), no. 11, pp. 824-831.
66. ANDREǏ A. MARKOV, Teoriia algorifmov, Works of the Mathematics Institute Im. V. A. Steklov, vol. 42, 1954, in Russian. English version: Theory of algorithms (J. J. Schorr-Kon, translator), American Mathematical Society Translations, Series 2, vol. 15, pp. 1-14, and Israel Program for Scientific Translations, Jerusalem, 1961.
67. YURI V. MATIJASEVIČ, Enumerable sets are Diophantine, Doklady Akademiia Nauk SSSR, vol. 191 (1970), no. 2, pp. 279-282, in Russian. English version: Soviet Mathematics, vol. 11 (1970), no. 2, pp. 354-357.
68. LUIGI FEDERICO MENABREA, Notions sur la machine analytique de M Charles Babbage, Bibliothèque Universelle de Genève n.s., vol. 41 (1842), pp. 352-376, in French. Also in: CHARLES BABBAGE, The works of Charles Babbage (M. Campbell-Kelly, editor), vol. 3, The difference engine and table making, NYU Press, New York, 1989, pp. 62-82. English version: Sketch of the Analytical Engine invented by Charles Babbage (with notes upon the memoir by the translator A. A. L. [Ada Augusta, Countess of Lovelace]), Scientific Memoirs (R. Taylor, editor), vol. 3, 1843, pp. 666-731, available at http://www.fourmilab.ch/babbage/sketch.html (viewedNov. 28, 2007).
69. ELLIOTT MENDELSON, Second thoughts about Church's thesis and mathematical proofs, The Journal of Philosophy, vol. 87 (1990), no. 5, pp. 225-233.
70. On the impossibility of proving the 'hard-half of Church's thesis, Church's thesis after 70 years (A. Olszewski, J. Wolenski, and R. Janusz, editors), Ontos Verlag, Frankfurt, 2006, pp. 304-309.
71. MARVIN MINSKY, Computation: Finite and infinite machines, 1st ed., Prentice-Hall, Englewood Cliffs, NJ, 1967.
72. RICHARD MONTAGUE, Towards a general theory of computability, Synthese, vol. 12 (1960), no. 4, pp. 429-438.
73. YIANNIS N. MOSCHOVAKIS, What is an algorithm?, Mathematics unlimited-2001 and beyond (B. Engquist and W. Schmid, editors), Springer-Verlag, Berlin, 2001, pp. 919-936, available at http://www.math.ucla.edu/∼ynm/papers/eng.ps (viewed Nov. 28, 2007).
74. PIERGIORGIO ODIFREDDI, Classical recursion theory: The theory of functions and sets of natural numbers, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, Amsterdam, 1992.
75. EMIL L. POST, Finite combinatory processes, Formulation I, The Journal of Symbolic Logic, vol. 1 (1936), pp. 103-105, reprinted in [27], pp. 289-303.
76. Absolutely unsolvable problems and relatively undecidable propositions: Account of an anticipation, unpublished paper, 1941, in [27], pp. 340-433. Also in Solvability, provability, definability: The collected works of Emil L. Post (M. Davis, editor), Birkhäuser, Boston, MA, 1994, pp. 375-441.
77. Formal reductions of the general combinatorial decision problem, American Journal of Mathematics, vol. 65 (1943), no. 2, pp. 197-215, available at doi:10.2307/2371809.
78. HILARY PUTNAM, Trial and error predicates and the solution to a problem of Mostowski, The Journal of Symbolic Logic, vol. 30 (1965), no. 1, pp. 49-57.
79. MICHAEL O. RABIN, Computable algebra, general theory and the theory of computable fields, Transactions of the American Mathematical Society, vol. 95 (1960), no. 2, pp. 341-360.
80. WOLFGANG REISIG, On Gurevich's theorem on sequential algorithms, Acta Informatica, vol. 39 (2003), no. 5, pp. 273-305, available at http://www.informatik.hu-berlin.de/top/download/publications/ Reisig2003_ai395.pdf (viewed Nov. 28, 2007).
81. MICHAEL RESCORLA, Church's Thesis and the conceptual analysis of computability, Notre Dame Journal of Formal Logic, vol. 48 (2007), no. 2, pp. 253-280.
82. HARTLEY ROGERS, JR., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967, reprinted by MIT Press, Cambridge, MA, 1987.
83. J. BARKLEY ROSSER, An informal exposition of proofs of Gödel's Theorem and Church's Theorem, The Journal of Symbolic Logic, vol. 4 (1939). pp. 53-60. reprinted in [27], pp. 223-230.
84. Highlights of the history of lambda calculus, IEEE Annals of the History of Computing, vol. 6 (1984), no. 4, pp. 337-349.
85. ARNOLD SCHONHAGE, Storage modification machines, SIAM Journal on Computing, vol. 9 (1980), no. 3, pp. 490-508.
86. N, Technical Report AIM-257, A. I. Laboratory, Massachusetts Institute of Technology, Cambridge, MA, May 1972, available at ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-257.pdf (viewed Nov. 28, 2007).
87. ORON SHAGRIR, Effective computation by humans and machines, Minds and Machines, vol. 12 (2002), no. 2, pp. 221-240, available at http://edelstein.huji.ac.il/staff/shagrir/papers/Effective- computation-by_human_and_machine.pdf (viewed Nov. 28, 2007).
88. STEWART SHAPIRO, Understanding Church's thesis, Journal of Philosophical Logic, vol. 10 (1981), pp. 353-365.
89. Acceptable notation, Notre Dame Journal of Formal Logic, vol. 23 (1982), pp. 14-20.
90. Understanding Church's thesis, again, Acta Analytica, vol. 11 (1995), pp. 59-77.
91. JOSEPH R. SHOENFIELD, Mathematical logic, Addison-Wesley, Reading, MA, 1967.
92. Recursion theory, Lecture Notes in Logic, vol. 1, Springer-Verlag, Berlin, 1993, reprinted by A. K. Peters, Natick, MA, 2001.
93. WILFRIED SIEG, Mechanical procedures and mathematical experiences, Mathematics and mind (A. George, editor), Oxford University Press, Oxford, 1994, pp. 71-117.
94. Step by recursive step: Church's analysis of effective computability, this BULLETIN, vol. 3 (1997), no. 2, pp. 154-180, available at http://www.math.ucla.edu/∼asl/bsl/0302/0302-002.ps (viewed Nov. 28, 2007).
95. Hilbert's programs: 1917-1922, this BULLETIN, vol. 5 (1999), no. 1, pp. 1-44, available at http://www.math.ucla.edu/∼asl/bsl/ 0501/0501-001.ps (viewed Apr. 21, 2008).
96. Calculations by man and machine: Conceptual analysis, Reflections on the foundations of mathematics: Essays in honor of Solomon Feferman (W. Sieg, R. Sommer, and C. Talcott, editors), Lecture Notes in Logic, vol. 15, A. K. Peters, Natick, MA, 2002, pp. 390-409.
97. Calculations by man and machine: Mathematical presentation, In the scope of logic, methodology and philosophy of science, vol. 1, Proceedings of the eleventh international congress of Logic, Methodology and Philosophy of Science, Cracow, Poland, August 1999 (P. Gärdenfors, J. Woleński, and K. Kijania-Placek, editors), Synthese Library, vol. 315, Kluwer Academic, Dordrecht, 2003, pp. 247-262.
98. Gödel on computability, Philosophia Mathematica, Series III, vol. 14 (2007), no. 2, pp. 189-207.
99. Church without dogma - Axioms for computability, New computational paradigms: Changing conceptions of what is computable (S. B. Cooper, B. Löwe, and A. Sorbi, editors), Springer-Verlag, Berlin, 2008, pp. 139-152. Available at http://www.hss.cmu.edu/philosophy/sieg/ Church%20without%20dogma.pdf (viewed Nov. 28, 2007).
100. Computability: Emergence and analysis of a mathematical notion, Handbook of the philosophy of mathematics (A. Irvine, editor), to appear.
101. WILFRED SIEG and JOHN BYRNES, K-graph machines: Generalizing Turing's machines and arguments, Gödel96: Logical Foundations of Mathematics, Computer Science, and Physics (P. Hájek, editor), Lecture Notes in Logic, vol. 6, Springer-Verlag, Berlin, 1996, pp. 98-119.
102. An abstract model for parallel computations: Candy's thesis, The Monist, vol. 82 (1999), no. 1, pp. 150-164.
103. ROBERT I. SOARE, Computability and recursion, this BULLETIN, vol. 2 (1996), no. 3, pp. 284-321, available at http://www.math.ucla.edu/∼asl/bsl/0203/0203-002.ps (viewed Nov. 28, 2007).
104. Computability and incomputability, Proceedings of the third conference on Computability in Europe (CiE 2007) Siena, Italy (S. B. Cooper, B. Löwe, and A. Sorbi, editors), Lecture Notes in Computer Science, vol. 4497, Springer-Verlag, Berlin, June 2007, pp. 705-715, draft available at http://www.people.cs.uchicago.edu/∼soare/siena502m.pdf (viewed Nov. 28, 2007). Longer version to appear.
105. ROBERT STÄRK, JOACHIM SCHMID, and EGON BÖRGER, Java and the Java Virtual Machine: Definition, verification, validation, Springer-Verlag, Berlin, 2001.
106. ALFRED TARSKI, Der Wahrheitsbegriff in den formalisierten Sprachen, Studio Philosophica, vol. 1 (1936), pp. 261-405, in German. English version: The concept of truth in formalized languages (J. H. Woodger, translator), Logic, semantics, methamathematics (J. Corcoran, editor), Hackett, Indianapolis, IN, 1983, pp. 152-277.
107. ALAN M. TURING, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, Series 2, vol. 42, parts 3 and 4 (1936), pp. 230-265, Corrigenda in vol. 43 (1937), pp. 544-546. Reprinted in [27], pp. 116-É 54; also in The essential Turing: Seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life, plus the secrets of Enigma (B. Jack Copeland, editor), Oxford University Press, 2004, pp. 58-90; and in Collected works of A. M. Turing, vol. 4, Mathematical logic (R. O. Gandy and C. E. M. Yates, editors), North-Holland, Amsterdam, 2001, pp. 18-56. Available at http://www.abelard.org/ turpap2/tp2-ie.asp (viewed Nov. 27, 2007).
108. Computability and λ-definability, The Journal of Symbolic Logic, vol. 2 (1937), pp. 153-163, reprinted in Collected works of A. M. Turing, vol. 4, Mathematical logic (R. O. Gandy and C. E. M. Yates, editors), North-Holland, Amsterdam, 2001, pp. 59-69.
109. Computing machinery and intelligence, Mind, vol. 59 (1950), pp. 433-460, reprinted in Collected works of A. M. Turing, vol. 1, Mechanical intelligence (D. C. Ince, editor), North-Holland, Amsterdam, 1992, pp. 133-160; and in The essential Turing (B. Jack Copeland, editor), Oxford University Press, 2004, pp. 433-464. Available athttp://web.comlab.ox.ac.uk/oucl/research/areas/ieg/elibrary/sources/t.article. pdf (viewed Nov. 28, 2007).
110. Solvable and unsolvable problems, Science News, vol. 31 (1954), pp. 7-23, reprinted in Collected works of A. M. Turing, vol. 1: Mechanical intelligence (D. C. Ince, editor), North-Holland, Amsterdam, 1992, pp. 187-204.
111. VLADIMIR A. USPENSKY and ALEXEI L. SEMENOV, Algorithms: Main ideas and applications, Kluwer, Norwell, MA, 1993.
112. HAO WANG, Front mathematics to philosophy, Routledge and Kegan Paul, London, 1974.
113. RICHARD ZACH, Completeness before Post: Bernays, Hubert, and the development of propositional logic, this BULLETIN, vol. 5 (1999), no. 3, pp. 331-366, available at http://www.math.ucla.edu/ ∼asl/bsl/0503/0503-003.ps (viewed Nov. 28, 2007).