scientific article; zbMATH DE number 922628
From MaRDI portal
Publication:4893148
zbMath0866.03022MaRDI QIDQ4893148
Publication date: 26 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityhonest functionssubrecursive degreessubrecursive jump operatorelementary reducibilitysubrecursive reducibility
Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (3)
Streamlined subrecursive degree theory ⋮ Computable irrational numbers with representations of surprising complexity ⋮ Honest elementary degrees and degrees of relative provability without the cupping property
This page was built for publication: