### 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 language | English |
---|---|

Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

Publisher | ACM |

Pages | 94-100 |

Number of pages | 7 |

Publication status | Published - 1987 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing.*ACM, pp. 94-100.

}

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 -