An early history of recursive functions and computability from Gödel to Turing

DOI10.1080/01445340.2011.641762zbMATH Open1308.00015OpenAlexW2024609526WikidataQ58543097 ScholiaQ58543097MaRDI QIDQ4983317

Ivor Grattan-Guinness

Publication date: 25 March 2015

Published in: History and Philosophy of Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01445340.2011.641762

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) External book reviews (00A17) Computability and recursion theory (03Dxx)

Related Items (1)

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 computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability

This page was built for publication: An early history of recursive functions and computability from Gödel to Turing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983317)