A Classification of the Recursive Functions

DOI10.1002/MALQ.19720180405MaRDI QIDQ5659521zbMATH OpenOpenAlexFDO

Authors Albert R. Meyer, Dennis M. Ritchie

Publication date 1972

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19720180405

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Cited in

(19)

• ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
• Semi-honest subrecursive degrees and the collection rule in arithmetic
• Streamlined subrecursive degree theory
• The intrinsic difficulty of recursive functions
• Elementarily traceable irrational numbers
• Nonexistence of program optimizers in several abstract settings
• Augmented loop languages and classes of computable functions
• On the density of honest subrecursive classes
• Polynomial and abstract subrecursive classes
• Data representation and computational complexity
• Cook reducibility is faster than Karp reducibility in NP
• A maximal sequence of classes transformable by primitive recursion in a given class
• Complexity of algorithms and computations
• Relativization of the Theory of Computational Complexity
• On the computational power of automata with time or space bounded by Ackermann's or superexponential functions
• The structure of the honest polynomial m-degrees
• Honest elementary degrees and degrees of relative provability without the cupping property
• On computational reducibility
• On primitive recursive wordfunctions

This page was built for publication: A Classification of the Recursive Functions

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