On the density of honest subrecursive classes
Author:
- 30 April 1975
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 10 (2) , 183-199
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The honest subrecursive classes are a latticeInformation and Control, 1974
- Augmented loop languages and classes of computable functionsJournal of Computer and System Sciences, 1972
- A Classification of the Recursive FunctionsMathematical Logic Quarterly, 1972
- Recursive FunctionsNature, 1970
- Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 24–30.The Journal of Symbolic Logic, 1970
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- On a Subrecursive Hierarchy and Primitive Recursive DegreesTransactions of the American Mathematical Society, 1959
- 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