Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines

Authors:
Wolfgang Maass
Affiliations:
-
Venue:
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Year:
1984

Citing 3
Cited 0

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Two tapes are better than one for nondeterministic machines

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Two nonlinear lower bounds

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic l-tape Turing machines (all considered Turing machines have an additional oneway input tape). In particular we produce quadratic lower bounds for the simulation of 2-tape TM's by l-tape TM's and thus answer a rather old question (problem No.1 and No.7 in the list of Duris, Galil, Paul, Reischuk [3]). Further we demonstrate a substantial superiority of nondeterminism over determinism and of co-nondeterminism over nondeterminism for l-tape TM's.