Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)

  title={Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract)},
  author={Walter J. Savitch},
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))<supscrpt>2</supscrpt>-tape bounded Turing machine, provided L(n)≥log<subscrpt>2</subscrpt>n. 
Highly Cited
This paper has 20 citations. REVIEW CITATIONS