Origins of Recursive Function Theory
From MaRDI portal
Publication:4779210
DOI10.1109/MAHC.1981.10004zbMath0998.03501MaRDI QIDQ4779210
Publication date: 25 November 2002
Published in: IEEE Annals of the History of Computing (Search for Journal in Brave)
01A60: History of mathematics in the 20th century
03-03: History of mathematical logic and foundations
03D99: Computability and recursion theory
Related Items
Conceptual Confluence in 1936: Post and Turing, Proving Things About the Informal, Why Turing’s Thesis Is Not a Thesis, Folding left and right over Peano numbers, Mathematical and Technological Computability, The Developments of the Concept of Machine Computability from 1936 to the 1960s, Turing oracle machines, online computing, and three displacements in computability theory, The problem of space invariance for sequential machines, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Counting nondeterministic computations, Is there a ``Hilbert thesis?, Why Post Did [Not Have Turing’s Thesis]