Sub-computabilities

DOI10.1007/978-3-642-22953-4_28zbMath1342.03034OpenAlexW2914940747MaRDI QIDQ3088295

Grégory Lafitte, Fabien Givors

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)

Cites Work

• Streamlined subrecursive degree theory
• A jump operator on honest subrecursive degrees
• Classical recursion theory. Vol. II
• Elementary descent recursion and proof theory
• Computability and Randomness
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sub-computabilities