Advertisement

An optimal lower bound for turing machines with one work tape and a two-way input tape

  • Wolfgang Maass
  • Georg Schnitger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)

Abstract

This paper contains the first concrete lower bound argument for Turing machines with one work tape and a two-way input tape (these Turing machines are often called "offline 1-tape Turing machines"). In particular we prove an optimal lower bound of Ω(n3/2/(log n)1/2) for transposing a matrix with elements of bit length ∘(logn) (where n is the length of the total input). This implies a lower bound of Ω(n3/2/(log n)1/2) for sorting on the considered type of Turing machine. We also get as corollaries the first nonlinear lower bound for the most difficult version of the two tapes — versus — one problem, and a separation of the considered type of Turing machine from that with an additional write-only output tape.

Keywords

Turing Machine Kolmogorov Complexity Input Tape Matrix Transposition Output Tape 
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. [1]
    P. Duris, Z. Galil, W.J. Paul, and R. Reischuk, Two nonlinear lower bounds, Proc. 15th ACM STOC (1983) 127–132.Google Scholar
  2. [2]
    P. Erdös and G. Szekeres, A combinatorial problem in Geometry, Composito Math. 2(1935) 464–470.Google Scholar
  3. [3]
    F.C. Hennie, One-tape off-line Turing machine computations, Inf. and Control 8(1965) 553–578.Google Scholar
  4. [4]
    J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory. Languages and Computation, Addison-Wesley (Reading, 1979).Google Scholar
  5. [5]
    J.E. Hopcroft, W.J. Paul, and L. Valiant. On time versus space. J. of the ACM 24 (1977) 332–337.Google Scholar
  6. [6]
    W. Maass, Are recursion theoretic arguments useful in complexity theory? Proc. of the 7th International Conference on Logic, Methodology and Philosophy of Science, Salzburg 1983 (North-Holland, Amsterdam 1985).Google Scholar
  7. [7]
    W. Maass, Quadratic lower bounds for deterministic and non-deterministic one-tape Turing machines, Proc. of the 16th ACM STOC (1984) 401–408.Google Scholar
  8. [8]
    W. Maass, Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines, Trans. of the Amer. Math. Soc. 292(1985) 675–693.Google Scholar
  9. [9]
    W.J. Paul, Kolmogorov complexity and lower bounds, Proc. of the Second Int. Conf. on Fund. of Computation Theory, L. Budach ed., 325–334 (Akademie-Verlag, Berlin 1979).Google Scholar
  10. [10]
    W.J. Paul, On-line simulation of k+1 tapes by k tapes requires nonlinear time, Proc. 23rd IEEE FOCS (1982) 53–56.Google Scholar
  11. [11]
    W.J. Paul, N. Pippenger, E. Szemeredi and W. Trotter, On determinism versus nondeterminism and related problems, Proc. 24th IEEE FOCS (1983) 429–438.Google Scholar
  12. [12]
    H.J. Stoss, Rangierkomplexität von Permutationen, Acta Informatica 2 (1973) 80–96.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Wolfgang Maass
    • 1
  • Georg Schnitger
    • 2
  1. 1.Department of MathematicsStatistics and Computer Science University of Illinois at ChicagoChicago
  2. 2.Department of Computer SciencePennsylvania State UniversityUniversity Park

Personalised recommendations