Recursive Properties of Abstract Complexity Classes
- 1 April 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (2) , 296-308
- https://doi.org/10.1145/321694.321702
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Toward a Theory of EnumerationsJournal of the ACM, 1969
- 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
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958
- Some theorems on classes of recursively enumerable setsTransactions of the American Mathematical Society, 1958
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944