TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES.

Wolfgang Maass, Georg Schnitger, E. Szemerédi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

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).

Original languageEnglish
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
PublisherACM
Pages94-100
Number of pages7
Publication statusPublished - 1987

Fingerprint

Turing machines
Tapes
Concretes

ASJC Scopus subject areas

  • Software

Cite this

Maass, W., Schnitger, G., & Szemerédi, E. (1987). TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 94-100). ACM.

TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES. / Maass, Wolfgang; Schnitger, Georg; Szemerédi, E.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM, 1987. p. 94-100.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Maass, W, Schnitger, G & Szemerédi, E 1987, TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM, pp. 94-100.
Maass W, Schnitger G, Szemerédi E. TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM. 1987. p. 94-100
Maass, Wolfgang ; Schnitger, Georg ; Szemerédi, E. / TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM, 1987. pp. 94-100
@inproceedings{dad3c570b1b84327a7f091d26205c81c,
title = "TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES.",
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).",
author = "Wolfgang Maass and Georg Schnitger and E. Szemer{\'e}di",
year = "1987",
language = "English",
pages = "94--100",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "ACM",

}

TY - GEN

T1 - TWO TAPES ARE BETTER THAN ONE FOR OFF-LINE TURING MACHINES.

AU - Maass, Wolfgang

AU - Schnitger, Georg

AU - Szemerédi, E.

PY - 1987

Y1 - 1987

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=0023595644&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023595644&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023595644

SP - 94

EP - 100

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM

ER -