Two nonlinear lower bounds for on-line computations
Information and Control
Tape versus queue and stacks: the lower bounds
Information and Computation
Linear-time simulation of multihead turing machines
Information and Computation
Information and Computation
SIAM Journal on Computing
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Two tapes versus one for off-line Turing machines
Computational Complexity
Real-Time Simulation of Multihead Tape Units
Journal of the ACM (JACM)
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
Saving tapes in the simulation of multihead turing machines
ACM SIGACT News
The average-case area of Heilbronn-type triangles
Random Structures & Algorithms
Lorentz lattice gases and many-dimensional Turing machines
Collision-based computing
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
| Hi-index | 0.01 |
We show that a Turing machine with two single-head one-dimensional tapes cannot recognize the set.