The non-renamability of honesty classes

DOI10.1007/BF02242317zbMath0313.68037OpenAlexW387417990MaRDI QIDQ1220385

Peter van Emde Boas

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242317

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Some applications of the McCreight-Meyer algorithm in abstract complexity theory

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

This page was built for publication: The non-renamability of honesty classes