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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
