scientific article; zbMATH DE number 895229

MaRDI QIDQ4883239zbMATH OpenFDO

Authors Solomon Feferman

Publication date 1 July 1996

zbMATH Keywords

classical recursion theory over the natural numberscomplexity theorycomputabilityhistory of recursion theoryrecursion theory over general structuresrelative computation

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10) Computability and recursion theory (03Dxx)

Recommendations

• Turing oracle machines, online computing, and three displacements in computability theory
• Computability and Incomputability
• A non-standard study of the theory of relative recursivity
• The Foundations of Computability Theory
• scientific article; zbMATH DE number 1390011

Cited in

(5)

• Turing oracle machines, online computing, and three displacements in computability theory
• scientific article; zbMATH DE number 1405586 (Why is no real title available?)
• Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles
• A non-standard study of the theory of relative recursivity
• Fifty years of computability

This page was built for publication:

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