Advertisement

Speed-up theorem without tape compression

  • Viliam Geffert
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Abstract

We shall show that each nondeterministic single-tape Turing machine of time complexity T(n) ≥ n2 can be replaced by an equivalent k times faster nondeterministic machine writing only zeroes and ones on its tape, for each k ≥ 1. Therefore, nondeterministic single-tape Turing machines do not require the tape compression for speeding-up.

Keywords

Turing Machine Computation Path Current Segment Tape Head Tape Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. (HaSt).
    J. Hartmanis, R.E. Stearns: On the computational complexity of algorithms, Trans. Amer. Math. Soc., 117, 1965, 285–306Google Scholar
  2. (LoLi1).
    M.Liśkiewicz, K.Loryś: Fast simulations of time-bounded one-tape TM's by space-bounded ones, Technical Report N-187, Wrocław University, August 1987Google Scholar
  3. (LoLi2).
    M. Liśkiewicz, K. Loryś: Two applications of Fürer's counter to one-tape nondeterministic TM's, Proceedings of MFCS'88, LNCS 324, Springer-Verlag 1988, 445–453Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Viliam Geffert
    • 1
  1. 1.Department of Computer ScienceUniversity of P.J.ŠafárikKošiceCzechoslovakia

Personalised recommendations