Publication:4893148
From MaRDI portal
zbMath0866.03022MaRDI QIDQ4893148
Publication date: 26 June 1997
computational complexity; honest functions; subrecursive degrees; subrecursive jump operator; elementary reducibility; subrecursive reducibility
03D15: Complexity of computation (including implicit computational complexity)
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
Streamlined subrecursive degree theory, Honest elementary degrees and degrees of relative provability without the cupping property, Computable irrational numbers with representations of surprising complexity