On restricted turing computability
- 1 December 1971
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 5 (4) , 331-343
- https://doi.org/10.1007/bf01694077
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On computational speed-upPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- Relations Between Time and Tape ComplexitiesJournal of the ACM, 1968
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- Turing machines with a schedule to keepInformation and Control, 1967
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Two-Tape Simulation of Multitape Turing MachinesJournal of the ACM, 1966
- One-tape, off-line Turing machine computationsInformation and Control, 1965
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Translational methods and computational complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- Hierarchies of memory limited computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965