Origins of Recursive Function Theory

DOI10.1109/MAHC.1981.10004zbMATH Open0998.03501OpenAlexW2081416038MaRDI QIDQ4779210FDOQ4779210

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 (15)

• What is the Church-Turing Thesis?
• Why post did [not] have Turing's thesis
• The developments of the concept of machine computability from 1936 to the 1960s
• The problem of space invariance for sequential machines
• Folding left and right over Peano numbers
• Proving Things About the Informal
• Algorithmic economics: incomputability, undecidability and unsolvability in economics
• Is there a ``Hilbert thesis?
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Mathematical and technological computability
• Turing oracle machines, online computing, and three displacements in computability theory
• Counting nondeterministic computations
• Conceptual Confluence in 1936: Post and Turing
• Folding left and right matters: Direct style, accumulators, and continuations
• Why Turing’s Thesis Is Not a Thesis

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)