Two tapes versus one for off-line Turing machines

Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán

Research output: Contribution to journalArticle

9 Citations (Scopus)


We prove the first superlinear lower bound for a concrete, polynomial time recognizable decision problem on a Turing machine with one work tape and a two-way input tape (also called off-line 1-tape Turing machine). In particular, for off-line Turing machines we show that two tapes are better than one and that three pushdown stores are better than two (both in the deterministic and in the nondeterministic case).

Original languageEnglish
Pages (from-to)392-401
Number of pages10
JournalComputational Complexity
Issue number4
Publication statusPublished - Dec 1 1993


  • Subject classifications: 68Q05, 68Q25
  • lower bounds
  • nondeterminism
  • off-line 1-tape Turing machines
  • time
  • two tapes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Mathematics(all)
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Two tapes versus one for off-line Turing machines'. Together they form a unique fingerprint.

  • Cite this