Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computabili
DOI10.1016/J.HM.2018.08.001zbMATH Open1417.00050OpenAlexW2889502692WikidataQ129311426 ScholiaQ129311426MaRDI QIDQ2631823FDOQ2631823
Authors: Christopher P. Porter 
Publication date: 16 May 2019
Published in: Historia Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.hm.2018.08.001
Recommendations
- An early history of recursive functions and computability from Gödel to Turing
- Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp.
- Computability. Turing, Gödel, Church, and beyond
- An early history of recursive functions and computability from Gödel to Turing
- scientific article; zbMATH DE number 5187689
- scientific article; zbMATH DE number 1869992
- Book review of: M. D. Davis, The universal computer. The road from Leibniz to Turing. 3rd edition
- scientific article; zbMATH DE number 7447635
- scientific article; zbMATH DE number 870426
- scientific article; zbMATH DE number 7526254
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Collections of articles of miscellaneous specific interest (00B15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) External book reviews (00A17) Proceedings, conferences, collections, etc. pertaining to history and biography (01-06) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) History of mathematical logic and foundations (03-03) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Computability and recursion theory (03Dxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Title not available (Why is that?)
- Emil Post and His Anticipation of Gödel and Turing
- Computability and Recursion
- Title not available (Why is that?)
This page was built for publication: Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computabili
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631823)
