The non-renamability of honesty classes
From MaRDI portal
Publication:1220385
DOI10.1007/BF02242317zbMath0313.68037OpenAlexW387417990MaRDI QIDQ1220385
Publication date: 1975
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242317
Related Items
Cites Work
- Unnamed Item
- Honest bounds for complexity classes of recursive functions
- Ordinal Hierarchies and Naming Complexity Classes
- Classes of computable functions defined by bounds on computation
- A Machine-Independent Theory of the Complexity of Recursive Functions
- The Operator Gap
- Computational Complexity and the Existence of Complexity Gaps