Indexings of subrecursive classes
Open Access
- 31 July 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 11 (3), 277-301
- https://doi.org/10.1016/0304-3975(80)90017-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Nonexistence of program optimizers in several abstract settingsJournal of Computer and System Sciences, 1976
- Polynomial and abstract subrecursive classesJournal of Computer and System Sciences, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On the density of honest subrecursive classesJournal of Computer and System Sciences, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Subrecursive Programming Languages, Part IJournal of the ACM, 1972
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Extension of an effectively generated class of functions by enumerationColloquium Mathematicum, 1958
- Classes of recursively enumerable sets and their decision problemsTransactions of the American Mathematical Society, 1953