An operator embedding theorem for complexity classes of recursive functions

DOI10.1016/0304-3975(76)90055-4MaRDI QIDQ1225934zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Augmented loop languages and classes of computable functions
• Classes of computable functions defined by bounds on computation
• Classifications of Recursive Functions by Means of Hierarchies
• Computational speed-up by effective operators
• Degrees of computational complexity
• Degrees of Unsolvability. (AM-55)
• Diversity of speed-ups and embeddability in computational complexity
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On classes of computable functions

Cited in

(1)

• Sequential fuzzy system identification

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225934)