Two-Tape Simulation of Multitape Turing Machines

@article{Hennie1966TwoTapeSO,
  title={Two-Tape Simulation of Multitape Turing Machines},
  author={F. Hennie and R. Stearns},
  journal={J. ACM},
  year={1966},
  volume={13},
  pages={533-546}
}
  • F. Hennie, R. Stearns
  • Published 1966
  • Mathematics, Computer Science
  • J. ACM
  • It has long been known that increasing the number of tapes used by a Turing machine does not provide the ability to compute any new functions. On the other hand, the use of extra tapes does make it possible to speed up the computation of certain functions. It is known that a square factor is sometimes required for a one-tape machine to behave as a two-tape machine and that a square factor is always sufficient. The purpose of this paper is to show that, if a given function requires computation… CONTINUE READING
    267 Citations

    Topics from this paper

    Time Complexity of Tape Reduction for Reversible Turing Machines
    • 6
    On restricted turing computability
    • E. Glinert
    • Mathematics, Computer Science
    • Mathematical systems theory
    • 2005
    • 1
    • Highly Influenced
    Computational Complexity of One-Tape Turing Machine Computations
    • 67
    • PDF
    Note on Tape Reversal Complexity of Languages
    • 18
    Turing Machines with a Schedule to Keep
    • P. Fischer
    • Mathematics, Computer Science
    • Inf. Control.
    • 1967
    • 16
    An Improved Simulation Result for Ink-Bounded Turing Machines
    • 3
    • PDF
    Deterministic Multitape Automata Computations
    On Time Versus Space
    • 266
    • PDF
    Multi-tape and infinite-state automata—a survey
    • 24
    A Note on Square Rooting of Time Functions of Turing Machines