Degrees of Total Algorithms versus Degrees of Honest Functions
From MaRDI portal
Publication:2904437
DOI10.1007/978-3-642-30870-3_43zbMath1358.03052OpenAlexW2203030842MaRDI QIDQ2904437
Publication date: 14 August 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_43
Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items
Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ Honest elementary degrees and degrees of relative provability without the cupping property
This page was built for publication: Degrees of Total Algorithms versus Degrees of Honest Functions