Complexity classes of provable recursive functions
- 1 June 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (3) , 294-303
- https://doi.org/10.1016/0022-0000(79)90037-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimization Among Provably Equivalent ProgramsJournal of the ACM, 1977
- Independence results in computer scienceACM SIGACT News, 1976
- An Overview of the Theory of Computational ComplexityJournal of the ACM, 1971
- Abstract computational complexity and cycling computationsJournal of Computer and System Sciences, 1971
- On Effective Procedures for Speeding Up AlgorithmsJournal of the ACM, 1971
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Theory of provable recursive functionsTransactions of the American Mathematical Society, 1965