Computational complexity of random access stored program machines
- 1 September 1971
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 5 (3) , 232-245
- https://doi.org/10.1007/bf01694180
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Classes of computable functions defined by bounds on computationPublished by Association for Computing Machinery (ACM) ,1969
- Tape-reversal bounded turing machine computationsJournal of Computer and System Sciences, 1968
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- 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
- Random-Access Stored-Program Machines, an Approach to Programming LanguagesJournal of the ACM, 1964
- Real time computationIsrael Journal of Mathematics, 1963