Sub-computabilities

DOI10.1007/978-3-642-22953-4_28MaRDI QIDQ3088295zbMATH OpenOpenAlexFDO

Authors Fabien Givors, Grégory Lafitte

Publication date 19 August 2011

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22953-4_28

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Sub-Turing reducibilities of restricted complexity
• scientific article; zbMATH DE number 1747699
• Computably enumerable sets and related issues
• scientific article; zbMATH DE number 4091484
• scientific article; zbMATH DE number 1163992

Cites work

• A jump operator on honest subrecursive degrees
• Classical recursion theory. Vol. II
• Computability and Randomness
• Elementary descent recursion and proof theory
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 1507242 (Why is no real title available?)
• scientific article; zbMATH DE number 1390277 (Why is no real title available?)
• Streamlined subrecursive degree theory

Cited in

(2)

• Sub-Turing reducibilities of restricted complexity
• scientific article; zbMATH DE number 1163992 (Why is no real title available?)

This page was built for publication: Sub-computabilities

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