Augmented loop languages and classes of computable functions
- 31 December 1972
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 6 (6) , 603-624
- https://doi.org/10.1016/s0022-0000(72)80032-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the structure of subrecursive degreesJournal of Computer and System Sciences, 1970
- On the efficiency of programs in subrecursive formalismsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1970
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- A Hierarchy of Primitive Recursive FunctionsMathematical Logic Quarterly, 1963
- Classifications of recursive functions by means of hierarchiesTransactions of the American Mathematical Society, 1962
- On a subrecursive hierarchy and primitive recursive degreesTransactions of the American Mathematical Society, 1959
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958
- Extension of an effectively generated class of functions by enumerationColloquium Mathematicum, 1958
- The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1954