Two heads are better than two tapes

We show that a Turing machine with two single-head one-dimensional tapes cannot recognize the set.

[1]  Ming Li,et al.  Tape versus Queue and Stacks: The Lower Bounds , 1988, Inf. Comput..

[2]  Jirí Becvár,et al.  Real-time and complexity problems in automata theory , 1965, Kybernetika.

[3]  Wolfgang J. Paul,et al.  On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  R. Reischuk,et al.  Coding strings by pairs of strings , 1985 .

[5]  Wolfgang J. Paul,et al.  On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6]  F. C. Hennie,et al.  On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..

[7]  Victor L. Bennison.  Saving tapes in the simulation of multihead turing machines , 1974, SIGA.

[8]  Wolfgang J. Paul,et al.  An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..

[9]  Janos Simon,et al.  Milking the Aanderaa Argument , 1990, Inf. Comput..

[10]  Wolfgang J. Paul,et al.  On heads versus tapes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[11]  M. K. Valiev,et al.  Certain estimates of the time of computations on turing machines with an input , 1970 .

[12]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[13]  Journal of the Association for Computing Machinery , 1961, Nature.

[14]  Arnold L. Rosenberg,et al.  Turing Machines with Several Read-Write Heads (Preliminary Report) , 1967, SWAT.

[15]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[16]  Arnold L. Rosenberg,et al.  Real-Time Simulation of Multihead Tape Units , 1972, JACM.

[17]  Joel I. Seiferas,et al.  New Real-Time Simulations of Multihead Tape Units , 1981, J. ACM.

[18]  Wolfgang J. Paul,et al.  On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, FOCS 1982.

[19]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[20]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[21]  Wolfgang J. Paul,et al.  Two Nonlinear Lower Bounds for On-Line Computations , 1984, Inf. Control..

[22]  Hans-Jörg Stoß,et al.  Linear-Time Simulation of Multihead Turing Machines , 1989, Inf. Comput..

[23]  Luc Longpré,et al.  The Power of the Queue , 1986, SIAM J. Comput..

[24]  W. Maass.  Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines , 1985 .

[25]  Luc Longpré,et al.  The Power of the Queue , 1992, SIAM J. Comput..

[26]  M. Rabin.  Real time computation , 1963 .

[27]  Paul M. B. Vitányi,et al.  On Two-Tape Real-Time Computation and Queues , 1984, J. Comput. Syst. Sci..

[28]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.