A Classification of the Recursive Functions
From MaRDI portal
Publication:5659521
DOI10.1002/malq.19720180405zbMath0247.02037OpenAlexW2038671477MaRDI QIDQ5659521
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
Related Items
The structure of the honest polynomial m-degrees ⋮ The intrinsic difficulty of recursive functions ⋮ Data representation and computational complexity ⋮ Streamlined subrecursive degree theory ⋮ ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ Elementarily traceable irrational numbers ⋮ A maximal sequence of classes transformable by primitive recursion in a given class ⋮ Complexity of algorithms and computations ⋮ On the computational power of automata with time or space bounded by Ackermann's or superexponential functions ⋮ Honest elementary degrees and degrees of relative provability without the cupping property ⋮ Augmented loop languages and classes of computable functions ⋮ On primitive recursive wordfunctions ⋮ Polynomial and abstract subrecursive classes ⋮ On the density of honest subrecursive classes ⋮ Nonexistence of program optimizers in several abstract settings ⋮ On computational reducibility ⋮ Cook reducibility is faster than Karp reducibility in NP ⋮ Relativization of the Theory of Computational Complexity
