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.001zbMath1417.00050OpenAlexW2889502692WikidataQ129311426 ScholiaQ129311426MaRDI QIDQ2631823
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) History of mathematical logic and foundations (03-03) Proceedings, conferences, collections, etc. pertaining to history and biography (01-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10) History of computer science (68-03) External book reviews (00A17) Computability and recursion theory (03Dxx)
Cites Work
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
