An operator embedding theorem for complexity classes of recursive functions

DOI10.1016/0304-3975(76)90055-4zbMath0326.68031OpenAlexW2089245341MaRDI QIDQ1225934

Robert Moll

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90055-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Sequential fuzzy system identification

Cites Work

• Unnamed Item
• Augmented loop languages and classes of computable functions
• Degrees of computational complexity
• Classifications of Recursive Functions by Means of Hierarchies
• Diversity of speed-ups and embeddability in computational complexity
• On classes of computable functions
• Classes of computable functions defined by bounds on computation
• Degrees of Unsolvability. (AM-55)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational speed-up by effective operators

This page was built for publication: An operator embedding theorem for complexity classes of recursive functions