The ‘almost all’ theory of subrecursive degrees is decidable
- 1 January 1974
- book chapter
- Published by Springer Nature
- p. 317-325
- https://doi.org/10.1007/3-540-06841-4_70
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Polynomial and abstract subrecursive classesPublished by Association for Computing Machinery (ACM) ,1974
- On the size of sets of computable functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Polynominal time reducibilityPublished by Association for Computing Machinery (ACM) ,1973
- Type two computational complexityPublished by Association for Computing Machinery (ACM) ,1973
- Augmented loop languages and classes of computable functionsJournal of Computer and System Sciences, 1972
- Decidability of the “almost all” theory of degreesThe Journal of Symbolic Logic, 1972
- A Classification of the Recursive FunctionsMathematical Logic Quarterly, 1972
- Constructive measure theoryMemoirs of the American Mathematical Society, 1972