An optimal lower bound for turing machines with one work tape and a two-way input tape

7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper contains the first concrete lower bound argument for Turing machines with one work tape and a two-way input tape (these Turing machines are often called "offline 1-tape Turing machines"). In particular we prove an optimal lower bound of Ω(n3/2/(log n)1/2) for transposing a matrix with elements of bit length ∘(logn) (where n is the length of the total input). This implies a lower bound of Ω(n3/2/(log n)1/2) for sorting on the considered type of Turing machine. We also get as corollaries the first nonlinear lower bound for the most difficult version of the two tapes — versus — one problem, and a separation of the considered type of Turing machine from that with an additional write-only output tape.

Cite

CITATION STYLE

APA

Maass, W., & Schnitger, G. (1986). An optimal lower bound for turing machines with one work tape and a two-way input tape. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 223 LNCS, pp. 249–264). Springer Verlag. https://doi.org/10.1007/3-540-16486-3_103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free