Two heads are better than two tapes
Tao Jiang, Joel Seiferas, Paul Vitanyi
Abstract
We show that a Turing machine with two single-head one-dimensional tapes cannot recognize the set x2x'| x ∈ 0,1* and x' is a prefix of x in real time, although it can do so with three tapes, two two-dimensional tapes, or one two-head tape, or in linear time with just one tape. In particular, this settles the longstanding conjecture that a two-head Turing machine can recognize more languages in real time if its heads are on the same one-dimensional tape than if they are on separate one-dimensional tapes.
Create a lesson
Related papers
The determinantal complexity of the 4*4 permanent is 15
Karthik Sheshadri
A Width Hierarchy of Monotone Algebraic Branching Programs
Julian Dörfler, Alexander Rogovskyy
Mortality Is Undecidable for 2 × 2 Integer Matrices
Thanin Quartz, Ivan O. Shevchenko, Hans De Sterck et al.
Fourier Entropy Bounds via Approximations
Manaswi Paraashar, Nitin Saurabh
An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
Sergey Salishev
Exhaustive Search Is Hard to Beat in Constant Depth for Hyperclique and Orthogonal Vectors
Nikolai Chukhin