Speed-up theorem without tape compression
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.
KeywordsTuring Machine Computation Path Current Segment Tape Head Tape Position
Unable to display preview. Download preview PDF.
- (HaSt).J. Hartmanis, R.E. Stearns: On the computational complexity of algorithms, Trans. Amer. Math. Soc., 117, 1965, 285–306Google Scholar
- (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
- (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