Origins of Recursive Function Theory

DOI10.1109/MAHC.1981.10004MaRDI QIDQ4779210zbMATH OpenOpenAlexFDO

Authors Stephen Cole Kleene

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)

Cited in

(17)

• 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
• 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
• What is the Church-Turing Thesis?
• The developments of the concept of machine computability from 1936 to the 1960s
• Folding left and right matters: Direct style, accumulators, and continuations
• Algorithmic economics: incomputability, undecidability and unsolvability in economics
• Martin Davis: an overview of his work in logic, computer science, and philosophy
• Natural constructive proofs of A via A B, proof paradoxes, and impredicativity

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

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