Martin Davis’s Bibliography 1950-2015

Eugenio G. Omodeo

Abstract This appendix offers a comprehensive list of articles and books which Martin Davis has published till the present day, cross-referenced with a list of bibliographic entries regarding conference proceedings, paper collections, and books, to which he has contributed. Our list does not include the many reviews written by Martin Davis, in particular the ones which have appeared on The Journal of Symbolic Logic.

This appendix offers a comprehensive list of articles and books which Martin Davis has published till the present day, cross-referenced with a list of bibliographic entries regarding conference proceedings, paper collections, and books, to which he has contributed.

Our list does not include the many reviews written by Martin Davis, in particular the ones which have appeared on The Journal of Symbolic Logic.

  • (1) M. Davis. Arithmetical problems and recursively enumerable predicates (abstract). J. Symbolic Logic, 15(1):77-78, 1950.
  • (2) M. Davis. On the theory of recursive unsolvability. PhD thesis, Princeton University, May 1950.
  • (3) M. Davis. Relatively recursive functions and the extended Kleene hierarchy. In Proceedings of the International Congress of Mathematicians (Harvard University, Cambridge, MA, August 30-September 6, 1950), volume 1, page 723. AMS, Providence, RI, 1952.
  • (4) M. Davis. Arithmetical problems and recursively enumerable predicates. J. Symbolic Logic, 18(1):33-41, 1953. Russian transl. in [1, pp. 15-22].
  • (5) M. Davis. A note on universal Turing machines. In Claude E. Shannon and John McCarthy, editors, Automata Studies, volume 34 of Ann. of Math. Stud., pages 167-175. Princeton University Press, 1956.
  • (6) M. Davis. The definition of universal Turing machine. Proc. Amer. Math. Soc., 8(6):1125-1126, December 1957.
  • (7) M. Davis. Computability and Unsolvability. McGraw-Hill, New York, 1958. Reprinted with an additional appendix, Dover 1983. Japanese translation 1966. Italian translation: (8).
  • (8) M. Davis. Computabilita e Insolubilita—Introduzionealia teoriadellacomputabilita e alla teoria delle funzioni ricorsive. Collana di Epistemologia diretta da Evandro Agazzi. Edizioni Abete, Roma, 1975. Italian translation of (7); foreword by Mariano Bianca (ed.).
  • (9) M. Davis and Hilary Putnam. Reductions of Hilbert’s tenth problem. J. Symbolic Logic, 23(2):183-187, 1958. Russian transl. in [1, pp. 49-53].
  • (10) M. Davis and Hilary Putnam. Feasible computational methods in the propositional calculus. Technical report, Rensselaer Polytechnic Institute, Research Division, Troy, New York, October 1958. (Reprinted in this book, pp. 371405.)
  • (11) M. Davis and Hilary Putnam. On Hilbert’s tenth problem. Notices Amer. Math. Soc., 6(5):544, 1959.
  • (12) M. Davis and Hilary Putnam. A computational proof procedure; Axioms for number theory; Research on Hilbert’s Tenth Problem. Technical Report AFOSR TR59-124, U.S. Air Force, October 1959. (Partly reprinted in this book, pp. 407-426.)
  • (13) M. Davis. A program for Presburger’s algorithm. In Summaries of talks presented at the Summer Institute of Symbolic Logic in 1957at Cornell University, volume 2, pages 215-223, Princeton, NJ, 1960. Communications Research Division, Institute for Defense Analyses. Reprinted as “A computer program for Presburger’s algorithm” in [5, pp. 41-48].
  • (14) M. Davis. Computable functional of arbitrary finite type. In Summaries of talks presented at the Summer Institute of Symbolic Logic in 1957 at Cornell University, pages 242-246. Institute for Defense Analyses, 1960.
  • (15) M. Davis and Hilary Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201-215, 1960. Preprinted as (12, Part I); reprinted in [5, pp. 125-139].
  • (16) M. Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential Diophantine equations. Ann. of Math. (2), 74(3):425-436, 1961. Reprinted in [14, pp. 77-88]. Russian transl. in [1, pp. 69-79].
  • (17) M. Davis. Aspects of mechanical theorem-proving. In Proceedings of Third International Congress on Cybernetics (Namur, Belgium, 11-15 September 1961), Association Internationale de Cybernetique, pages 415-418. Gauthier- Villars, Paris, 1965.
  • (18) M. Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Technical Report AFOSR 819, IMM-NYU 288, New York University, Institute of Mathematical Sciences, June 1961.
  • (19) M. Davis, George Logemann, and Donald W. Loveland. A machine program for theorem-proving. Commun.ACM, 5(7):394-397,1962. Preprinted as (18); reprinted in [5, pp. 267-270].
  • (20) M. Davis. Applications of recursive function theory to number theory. In J. C. E. Dekker, editor, Recursive Function Theory, volume 5 of Proc. Sympos. Pure Math., pages 135-138. American Mathematical Society, Providence, RI, 1962. (Third printing, with corrections, 1979).
  • (21) M. Davis. Unsolvable problems: A review. In Jerome Fox and Rose Meyerson, editors, Mathematical Theory of Automata: Proc. Symp. Math. Th. Aut., New York, N.Y., April 24,25,26,1962, volume 12 of Microwave Research Institute symposia, pages 15-22. Polytechnic Press, 1963.
  • (22) M. Davis and Hilary Putnam. Diophantine sets over polynomial rings. Illinois J. Math., 7(2):251-256, 1963. Russian transl. in [1, pp. 85-90].
  • (23) M. Davis. Extensions and corollaries of recent work on Hilbert’s tenth problem. Illinois J. Math., 7(2):246-250, 1963. Russian transl. in [1, pp. 80-84].
  • (24) M. Davis. Eliminating the irrelevant from mechanical proofs. In Proc. Symp. Appl. Math., volume 15, pages 15-30, Providence, RI, 1963. AMS. Reprinted in [5, pp. 315-330]; Russian transl. in [2, pp. 160-179].
  • (25) Thomas J. Chinlund, M. Davis, Peter G. Hinman, and Malcolm Douglas McIl- roy. Theorem-proving by matching. Technical report, Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey, 1964.
  • (26) M. Davis, editor. The UndecidableBasic Papers in Undecidable Propositions, Unsolvable Problems and Computable Functions. Raven Press, New York, 1965. Corrected reprinted edition, Dover Publications, Mineola, NY, 2004.
  • (27) M. Davis. Meeting of the Association for Symbolic Logic. J. Symbolic Logic, 31(4):697-706, 1966.
  • (28) M. Davis. Diophantine equations and recursively enumerable sets. In Eduardo R. Caianiello, editor, Automata Theory, pages 146-152. Academic Press,
  • 1966.
  • (29) M. Davis. Recursive functions—An introduction. In Eduardo R. Caianiello, editor, Automata Theory, pages 153-163. Academic Press, 1966.
  • (30) M. Davis. Computability. In Proceedings of the Symposium on System Theory, pages 127-131, Brooklyn, N.Y., 1966.
  • (31) M. Davis. Lectures on Modern Mathematics. Gordon and Breach, 1967. 196 pp.
  • (32) M. Davis. A First Course in Functional Analysis. Gordon and Breach, 1967. 110 pp., Reprinted Dover 2013.
  • (33) M. Davis. Recursive function theory. In Paul Edwards, editor, Encyclopedia of Philosophy, volume 7, pages 89-98. Macmillan and Free Press, New York,
  • 1967.
  • (34) M. Davis. One equation to rule them all. Technical Report RM-5494-PR, The RAND Corporation, Santa Monica, CA, February 1968.
  • (35) M. Davis. One equation to rule them all. Transactions of the New York Academy of Sciences. Series II, 30(6):766-773, 1968.
  • (36) M. Davis. An explicit Diophantine definition of the exponential function. Comm. Pure Appl. Math., XXIV(2):137-145, 1971.
  • (37) M. Davis. On the number of solutions of Diophantine equations. Proc. Amer. Math. Soc., 35(2):552-554, 1972.
  • (38) M. Davis and Reuben Hersh. Nonstandard analysis. Scientific American, 226:78-86, 1972.
  • (39) M. Davis and R. Hersh. Hilbert’s 10th problem. Scientific American, 229:8491, 1973. Reprinted in [4, pp. 555-571] and in [6, pp. 136-148]; Italian translation [3, pp. 138-146].
  • (40) M. Davis. Hilbert’s tenth problem is unsolvable. Amer. Math. Monthly, 80(3):233-269,1973. Reprinted with corrections as Appendix 2 of the Dover edition of Computability and Unsolvability (7, pp. 199-235).
  • (41) M. Davis. Speed-up theorems and Diophantine equations. In Randall Rustin, editor, Courant Computer Science Symposium 7: Computational Complexity, pages 87-95. Algorithmics Press, Inc., New York, NY, 1973.
  • (42) M. Davis. Computability, 1973-1974. Notes by Barry Jacobs, Courant Institute of Mathematical Sciences, New York University, 1974. Based on the course “Computers and computability” as given at the Courant Institute of Mathematical Sciences, in the Fall 1973 semester.
  • (43) M. Davis, Yuri Matijasevic, and Julia Robinson. Hilbert’s tenth problem. Diophantine equations: positive aspects of a negative solution. In Mathematical Developments Arising From Hilbert Problems, volume 28 of Proc. Sympos. Pure Math., pages 323-378, Providence, RI, 1976. AMS. Reprinted in [14, pp. 269-378].
  • (44) M. Davis. Applied nonstandard analysis. John Wiley & Sons, Inc., 1977. Reprinted with corrections Dover, 2005. Russian translation, Izdatel’stvo Mir, Moscow 1980. Japanese translation 1977.
  • (45) M. Davis. Unsolvable problems. In Jon Barwise, editor, Handbook ofMath- ematical Logic, pages 567-594. North-Holland, Amsterdam, 1977.
  • (46) M. Davis. A relativity principle in quantum mechanics. Internat. J. Theoret. Phys, 16(11):867-874, 1977.
  • (47) M. Davis and Jacob T. Schwartz. Correct-program technology / Extensibility of verifiers—Two papers on Program Verification with Appendix of Edith Deak. Technical Report No. NSO-12, Courant Institute of Mathematical Sciences, New York University, September 1977.
  • (48) M. Davis. What is a computation? In Lynn Arthur Steen, editor, Mathematics TodayTwelve Informal Essays, pages 241-267. Springer-Verlag, 1978.
  • (49) M. Davis and Jacob T. Schwartz. Metamathematical extensibility for theorem verifiers and proof-checkers. Comput. Math. Appl., 5:217-230, 1979. Also in (47, pp. 120-146).
  • (50) M. Davis. The mathematics of non-monotonic reasoning. Artif. Intell., 13(1- 2):73-80, 1980.
  • (51) M. Davis. Obvious logical inferences. In Proceedings of the 7th IJCAI Volume 1, pages 530-531, San Francisco, CA, USA, 1981. Morgan Kaufmann Publishers Inc.
  • (52) M. D. Davis and Elaine J. Weyuker. Pseudo-oracles for non-testable programs. In Proceedings of the ACM’81 Conference, pages 254-257, New York, NY, USA, 1981. ACM.
  • (53) M. Davis, Carl Smith, and Paul Young. Introduction. Information and Control, 52(1):1, 1982.
  • (54) M. Davis, Carl Smith, and Paul Young. Introduction. Information and Control, 54(1/2):1, 1982.
  • (55) M. Davis. Why Godel didn’t have Church’s thesis. Information and Control, 54(1/2):3-24, 1982.
  • (56) M. Davis. Lectures at “Atlanta State”. Annals of the History of Computing, 4(4):370-371, 1982.
  • (57) M. Davis. The prehistory and early history of Automated Deduction. In Siekmann and Wrightson [5], pages 1-28.
  • (58) M. D. Davis and Elaine J. Weyuker. Computability, Complexity, and LanguagesFundamentals of Theoretical Computer Science. Academic Press, 1983.
  • (59) M. D. Davis and Elaine J. Weyuker. A formal notion of program-based test data adequacy. Information and Control, 56(1/2):52-71, 1983.
  • (60) M. Davis, E. G. K. Lopez-Escobar, and Wilfried Sieg. Meeting of the Association for Symbolic Logic: Washington, D.C., 1985. J. Symbolic Logic, 51(4):1085-1092, 1986.
  • (61) M. Davis. Church’s Thesis. In [7, vol. 1, pp. 99-100]. John Wiley & Sons, 1987.
  • (62) M. Davis. Mathematical logic and the origin of modern computers. In [8, pp. 137-165], 1987. Reprinted in [9, pp. 149-174].
  • (63) M. Davis. Influences of mathematical logic on computer science. In [9, pp. 315-326]. Spanish translation: “Influencias de la Logica Matematica en las Ciencias de la Computation” by Facundo Garcia Valverde available at http://www.econ.uba.ar/www/departamentos/humanidades/plan97/logica/ legris/apuntes/davis.pdf.
  • (64) M. Davis and Rohit Parikh. Meeting of the Association for Symbolic Logic: New York City, May 1987. J. Symbolic Logic, 53(4):1270-1274, 1988.
  • (65) M. D. Davis and Elaine J. Weyuker. Metric space-based test-data adequacy criteria. The Computer Journal, 31(1):17-24, 1988.
  • (66) M. Davis. Trends in Logic: Relations with Computer Science. In [10, pp. 357359], 1989.
  • (67) M. Davis. Teaching the incompleteness theorem. In [10, pp. 385-392], 1989.
  • (68) M. Davis. Emil Post’s contributions to computer science. In [11, pp. 134136], 1989.
  • (69) M. Davis. Is mathematical insight algorithmic? Behavioral and Brain Sciences, 13(4):659-660, 1990.
  • (70) M. Davis. Review: Kurt Godel, Collected Works, vol. 1. J. Symbolic Logic, 55(1):340-348, 1990.
  • (71) M. Davis. Review: Richard L. Epstein and Walter A. Carnielli, Computability; (computable functions, logic, and the foundations of mathematics). Bull. Amer. Math. Soc. (N.S.), 25(1):106-111, 1991.
  • (72) M. Davis and Ronald Fechter. A free variable version of the flrst-order predicate calculus. J. Logic Comput., 1(4):431-451, 1991.
  • (73) M. Davis. How subtle is Godel’s theorem? More on Roger Penrose. Behavioral and Brain Sciences, 16:611-612, 9 1993.
  • (74) M. Davis. First order logic. In [12, pp. 31-65], 1993.
  • (75) M. Davis. Foreword to [13], pages xiii-xvii. 1993.
  • (76) M. Davis. Lecture notes in Logic, Courant Institute of Mathematical Sciences, New York University, 1993.
  • (77) M. D. Davis, Ron Sigal, and Elaine J. Weyuker. Computability, Complexity, and LanguagesFundamentals of Theoretical Computer Science. Academic Press, 2nd edition, 1994.
  • (78) Emil Leon Post and M. Davis. Solvability, Provability, Definability: The collected works of Emil L. Post. Contemporary mathematicians. Birkhauser, Boston, 1994. Including M. Davis’s article “Emil L. Post: His life and work”.
  • (79) M. Davis. American logic in the 1920s. Bull. Symbolic Logic, 1(3):273-278, 1995.
  • (80) M. Davis. The collaboration in the United States. In [15, pp. 91-97], 1996.
  • (81) M. Davis. From logic to computer science and back. In [16, pp. 53-85], 1999.
  • (82) M. Davis. The Universal Computer: The Road from Leibniz to Turing. W.W. Norton, 2000. Turing Centenary Edition, CRC Press, Taylor & Francis 2012.
  • (83) M. Davis. Engines of Logic: Mathematicians and the Origin of the Computer.

W.W. Norton, 2001. Paperpack edition of (82).

  • (84) M. Davis. The early history of Automated Deduction. In [17, pp. 3-15],2001.
  • (85) M. Davis. The myth of hypercomputation. In Christof Teuscher, editor, Alan Turing: Life and Legacy of a Great Thinker, pages 195-211. Springer Berlin Heidelberg, 2004.
  • (86) M. Davis. An appreciation of Bob Paige. Higher-Order and Symbolic Computation, 18(1-2):13-13, 2005.
  • (87) M. Davis. What did Godel believe and when did he believe it? Bull. Symbolic Logic, 11(2):194-206, 2005.
  • (88) M. Davis. The Church-Turing thesis: Consensus and opposition. In [18, pp. 125-132], 2006.
  • (89) M. Davis. Why there is no such discipline as hypercomputation. Appl. Math. Comput., 178(1):4-7, 2006. (Special issue on Hypercomputation, edited by F. A. Doria and J. F. Costa).
  • (90) M. Davis. SAT: Past and future. In [19, pp. 1-2], 2007.
  • (91) M. Davis. Inexhaustibility: A Non-Exhaustive Treatment by Torkel Franzen; Godel’s Theorem: An Incomplete Guide to Its Use and Misuse by Torkel Franzen. Amer. Math. Monthly, 115(3):270-275, 2008.
  • (92) M. Davis. I fondamenti dell’aritmetica. In Claudio Bartocci and Piergior- gio Odifreddi, editors, La matematica —Problemi e teoremi, Volume II, Grandi Opere, pages 33-60. Einaudi, 2008.
  • (93) George Paul Csicsery. Julia Robinson and Hilbert’s Tenth Problem. Zala Films, Oakland, CA, 2008, a documentary film with M. Davis, Yu. Matiyasevich, H. Putnam. See http://www.ams.org/ams/julia.html and http://www. zalafllms.com/fllms/juliarobinson.html.
  • (94) Allyn Jackson. Interview with Martin Davis. Notices Amer. Math. Soc., 55(5):560-571, 2008.
  • (95) M. Davis. Sex and the mathematician: The high school prom theorem. Games and Economic Behavior, 66(2):600, 2009.
  • (96) M. Davis. Diophantine equations and computation. In [20, pp. 4-5], 2009.
  • (97) M. Davis. Representation theorems for r.e. sets and a conjecture related to Poonen’s larges subring of Q. Zapiski Nauchnykh Seminarov Peter- burgskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova RAN (POMI), 377:50-54, 2010. Reproduced as (98).
  • (98) M. Davis. Representation theorems for recursively enumerable sets and a conjecture related to Poonen’s large subring of Q. J. Math. Sci. (N. Y.), 171(6):728-730, 2010. Reproduction of (97).
  • (99) M. Davis. Il decimo problema di Hilbert: equazioni e computabilita. In Claudio Bartocci and Piergiorgio Odifreddi, editors, La matematica—Pensare ilmondo, Volume IV, Grandi Opere, pages 135-160. Einaudi, 2010.
  • (100) M. Davis. Foreword to [21], pages vii-viii. 2011.
  • (101) M. Davis. Pragmatic Platonism. https://foundationaladventures.files. wordpress.com/2012/01/platonic.pdf, 2012. (A slightly revised version inside this book, pp. 349-356.)
  • (102) M. Davis. Three proofs of the unsolvability of the Entscheidungsproblem. In Cooper & Leeuwen, editor, Alan Turing: His Work and Impact, pages 49-52. Elsevier, 2012.
  • (103) M. Davis. Foreword to [22], 2012.
  • (104) M. Davis. Computability and Arithmetic. In [23, pp. 35-54], 2013.
  • (105) M. Davis. Logic and the development of the computer. In [24, pp. 31-38], 2014.
  • (106) M. Davis. Preface to [25], pp. v-viii, 2016.
  • (107) M. Davis and Wilfried Sieg. Conceptual Confluence in 1936: Post & Turing. In Sommaruga and Strahm [25, pp. 3-27], 2016.
  • (108) M. Davis. Algorithms, equations, and logic. In [26, pp. 4-19], 2016.
  • (109) M. Davis. Universality is ubiquitous. In [27].

References

  • 1. Matematika, 8(5), 1964. (MR 24 #A3061).
  • 2. Kiberneticheskiy sbornik. Novaya seriya, 7, 1970.
  • 3. Le Scienze Italian edition of Scientific American, 66, 1974.
  • 4. Abbott, J. C. (Ed.). (1978). The Chauvenetpapers, vol. 2. Mathematical Association of America.
  • 5. Siekmann, J., & Wrightson, G. (Eds.). (1983). Automation of Reasoning 1: Classical Papers on Computational Logic 1957-1966. Berlin, Heidelberg: Springer.
  • 6. Campbell, D. M., & Higgins, J. C. (Eds.). (1984). Mathematics: People, Problems, Results (Vol. 2). Belmont, CA: Wadsworth International.
  • 7. Shapiro, S. C., & Eckroth,D. (Eds.). (1987). Encyclopedia of Artificial Intelligence. John Wiley & Sons.
  • 8. Phillips, E. R. (Ed.). (1987). Studies in the History of Mathematics, (Vol. 26). Mathematical Association of America.
  • 9. Herken, R. (Eds.). (1988). The Universal Turing Machine—A half-century survey. Verlag Kam- merer & Unverzagt, Hamburg, Berlin 1988, Oxford University Press. (Springer 2nd edition, 1995).
  • 10. Ferro, R., Bonotto, C., Valentini, S., & Zanardo, A. (Eds.). (1989). Logic Colloquium 1988: Proceedings. (Elsevier North Holland Publishing Co., Amsterdam).
  • 11. Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS ’89), Pacific Grove, California, USA, June 5-8, 1989. IEEE Computer Society Press, Washington, D.C., 1989.
  • 12. Gabbay, D. M., Hogger, C. J., & Robinson, J. A. (Eds.). (1993). Handbook of Logic in Artificial Intelligence and Logic Programming. Vol. 1: logical foundations. Clarendon Press, Oxford.
  • 13. Matiyasevich, Yu. V. (1993). Hilbert’s tenth problem. The MIT Press, Cambridge (MA) and London, pp. xxii+264.
  • 14. J. Robinson. (1996). The collectedworks ofJulia Robinson, volume 6 of Collected Works.AMS, Providence, RI, pp. xliv+338 . ISBN 0-8218-0575-4. (With an introduction by Constance Reid. Edited and with a foreword by Solomon Feferman).
  • 15. Reid. C. (1996). Julia: A life in mathematics. (With contributions by I. L. Gaal, M. Davis, and Yu. V. Matijasevich). MAA Spectrum. The Mathematical Association of America, Washington, DC.
  • 16. Calude, C. S. (Ed.). (1999). People & ideas in theoretical computer science. Discrete Mathematics and Theoretical Computer Science. Singapore; New York: Springer.
  • 17. Robinson, J. A., & Voronkov A. (Eds.). (2001). Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press.
  • 18. Beckmann, A., Berger, U., Lowe, B., & Tucker, J. V. (Eds.). (2006). Logical Approaches to Computational Barriers. In Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, volume 3988 of Lecture Notes in Computer Science. Springer.
  • 19. Marques-Silva J., & Sakallah, K. A. (Eds.). (2007). Theory and Applications of Satisfiability TestingSAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings, volume 4501 of Lecture Notes in Computer Science. Springer.
  • 20. Calude, C. S., Costa, J. F., Dershowitz, N., Freire, E., & Rozenberg, G. (Eds.). (2009). Unconventional Computation, 8thInternational Conference, UC2009, Ponta Delgada, Azores, Portugal, September 7-11, 2009. Proceedings, volume 5715 of Lecture Notes in Computer Science. Springer.
  • 21. Schwartz, J. T., Cantone, D., & Omodeo, E. G. (2011). Computational Logic and Set TheoryApplying Formalized Logic to Analysis. Springer.
  • 22. Turing, S. (2012). Alan M. Turing: Centenary Edition. New York, NY, USA: Cambridge University Press.
  • 23. Jack Copeland, B., Posy, C. J., & Shagrir, O. (Eds.). (2013). Computability: Turing, Godel, Church, and beyond. MIT Press.
  • 24. Siekmann, J. H. (Ed.). (2014). Computational logic, volume 9 of Handbook of the History of Logic. Elsevier.
  • 25. Sommaruga, G., & Strahm, T. (Eds.). (2016). Turing’s Revolution—The Impact of His Ideas about Computability. Basel: Birkhauser.
  • 26. Barry Cooper, S., & Hodges, A. (Ed.). (2016). The Once and Future Turing—Computing the World. Cambridge University Press.
  • 27. Bokulich, A., & Floyd, J. (Ed.). (2012). Philosophical explorations of the legacy of Alan Turing—Turing 100 (An anthology based on the Turing 100 meeting in November 2012 at Boston University). Boston Studies in the Philosophy and History of Science. Springer Verlag, forthcoming.
.
 
Source
< Prev   CONTENTS   Source