Two tapes are better than one for off-line Turing machines

Authors:
W. Maass;G. Schnitger;E. Szemeredi
Affiliations:
Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago;Department of Computer Science, Pennsylvania State University;Department of Computer Science, Rutgers University, and Hungarian Academy of Sciences, Budapest
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 6
Cited 1

Four pages are necessary and sufficient for planar graphs

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The power of the queue

Proc. of the conference on Structure in complexity theory
An optimal lower bound for Turing machines with one work tape and a two-way input tape

Proc. of the conference on Structure in complexity theory
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Two nonlinear lower bounds

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI

Computational Aspects of VLSI

Lower bounds for the computational power of networks of spiking neurons

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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