On computational reducibility

DOI10.1016/S0022-0000(76)80022-0MaRDI QIDQ1232281zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• A Classification of the Recursive Functions
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Augmented loop languages and classes of computable functions
• Classes of Predictably Computable Functions
• Classes of computable functions defined by bounds on computation
• Degrees of computational complexity
• On the structure of subrecursive degrees
• Recursive Properties of Abstract Complexity Classes

This page was built for publication: On computational reducibility

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