Advertisement

The Mathematical Intelligencer

, Volume 40, Issue 2, pp 82–84 | Cite as

Martin Davis on Computability, Computational Logic, and Mathematical Foundations by E. Omodeo and A. Policriti (eds.)

SWITZERLAND: SPRINGER, OUTSTANDING CONTRIBUTIONS TO LOGIC, 10, 2016, 464 PP., US $ 129.00, ISBN-13: 978-3-319-41841-4
Review Osmo Pekonen, Editor
  • 21 Downloads

Notes

References

  1. Davis, Martin. 1958. Computability & Unsolvability. New York: McGraw-Hill.Google Scholar
  2. Davis, Martin, editor. 1965. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. New York: Raven Press.Google Scholar
  3. Davis, Martin. 2000. The Universal Computer: The Road from Leibniz to Turing. New York and London: W. W. Norton & Company.Google Scholar
  4. Hilbert, David and Paul Bernays. 1934. Grundlagen der Mathematik I. Berlin: Springer.Google Scholar
  5. Péter, Rosza. 1951. Rekursive Funktionen. Budapest: Akademiai Kiado.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of PhilosophyUniversity of HelsinkiHelsinkiFinland

Personalised recommendations