Deterministic simulation of non-deterministic turing machines (Detailed Abstract)

Authors:
Walter J. Savitch
Affiliations:
Department of Mathematics, University of California, Berkeley, California
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 0
Cited 7

An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
An Overview of the Theory of Computational Complexity

Journal of the ACM (JACM)
Computational complexity of probabilistic Turing machines

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The concept of nondeterminism: its development and implications for teaching

ACM SIGCSE Bulletin
Game Over: The Foci Approach to LTL Satisfiability and Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computations of non-deterministic Turing machines are shown to correspond to “solving” certain mazes. The storage needed to “solve” mazes is related to the storage needed to deterministically simulate non-deterministic Turing machines. In particular, it is shown that a non-deterministic L(n)-tape bounded Turing machine can be simulated by an (L(n))2-tape bounded Turing machine, provided L(n)≥log2n.