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

DOI10.1016/0304-3975(78)90041-5zbMath0384.68047OpenAlexW2113393761MaRDI QIDQ1249043

Peter van Emde Boas

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90041-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• The non-renamability of honesty classes
• A characterization of complexity sequences
• Honest bounds for complexity classes of recursive functions
• Classes of computable functions defined by bounds on computation
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• Computational speed-up by effective operators
• Computational Complexity and the Existence of Complexity Gaps
• Recursive Properties of Abstract Complexity Classes

This page was built for publication: Some applications of the McCreight-Meyer algorithm in abstract complexity theory