Tape-reversal bounded turing machine computations
- 1 August 1968
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 2 (2), 117-135
- https://doi.org/10.1016/s0022-0000(68)80027-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The reduction of tape reversals for off-line one-tape Turing machinesJournal of Computer and System Sciences, 1968
- Nonerasing stack automataJournal of Computer and System Sciences, 1967
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966
- Unrecognizable Sets of NumbersJournal 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
- Real time computationIsrael Journal of Mathematics, 1963
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963