Honest bounds for complexity classes of recursive functions

DOI10.2307/2272353zbMath0322.02038OpenAlexW2137184475MaRDI QIDQ4083408

No author found.

Publication date: 1974

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272353

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (4)

The non-renamability of honesty classes ⋮ Some applications of the McCreight-Meyer algorithm in abstract complexity theory ⋮ Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems ⋮ Relativization of the Theory of Computational Complexity

Cites Work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• The Operator Gap
• Computational Complexity and the Existence of Complexity Gaps
• Recursive Properties of Abstract Complexity Classes
• Unnamed Item

This page was built for publication: Honest bounds for complexity classes of recursive functions