On computational reducibility

DOI10.1016/S0022-0000(76)80022-0zbMath0343.02025OpenAlexW2018265106MaRDI QIDQ1232281

Forbes D. Lewis

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80022-0

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Augmented loop languages and classes of computable functions
• On the structure of subrecursive degrees
• Degrees of computational complexity
• Classes of Predictably Computable Functions
• Classes of computable functions defined by bounds on computation
• A Machine-Independent Theory of the Complexity of Recursive Functions
• A Classification of the Recursive Functions
• Recursive Properties of Abstract Complexity Classes

This page was built for publication: On computational reducibility