Origins of Recursive Function Theory

DOI10.1109/MAHC.1981.10004zbMath0998.03501OpenAlexW2081416038MaRDI QIDQ4779210

Publication date: 25 November 2002

Published in: IEEE Annals of the History of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/mahc.1981.10004

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Computability and recursion theory (03D99)

Related Items (14)

Is there a ``Hilbert thesis? ⋮ What is the Church-Turing Thesis? ⋮ The problem of space invariance for sequential machines ⋮ Folding left and right matters: Direct style, accumulators, and continuations ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Proving Things About the Informal ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Why Post Did [Not Have Turing’s Thesis] ⋮ Folding left and right over Peano numbers ⋮ Mathematical and Technological Computability ⋮ Counting nondeterministic computations ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s

This page was built for publication: Origins of Recursive Function Theory