On the structure of subrecursive degrees

DOI10.1016/S0022-0000(70)80042-3MaRDI QIDQ2546043zbMATH OpenFDO

Authors Sanat K. Basu

Publication date 1970

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(70)80042-3

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Extension of an effectively generated class of functions by enumeration
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3182472 (Why is no real title available?)
• On a Subrecursive Hierarchy and Primitive Recursive Degrees

Cited in

(3)

• Augmented loop languages and classes of computable functions
• On computational reducibility
• Semi-honest subrecursive degrees and the collection rule in arithmetic

This page was built for publication: On the structure of subrecursive degrees

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