Tape Bounds for Time-Bounded Turing Machines

@article{Paterson1972TapeBF,
  title={Tape Bounds for Time-Bounded Turing Machines},
  author={Mike Paterson},
  journal={J. Comput. Syst. Sci.},
  year={1972},
  volume={6},
  pages={116-124}
}
A terminated Turing machine computation can be represented by a two-dimensional diagram showing successive tape configurations. The machine to be described, when given an input word, searches for such a diagram. It achieves the stated economy in tape space by making repeated dichotomies in both the tape and time dimensions and carrying out the search for the resulting smaller subdiagrams sequentially. The deterministic simulation of nondeterministic machines described by Savitch [1] involves… CONTINUE READING