Milking the Aanderaa Argument

In the early 1970’s, by an intricate and involved counting argument, Stal Aanderaa managed to show for the first time that every additional tape adds to the power of a Turing machine that operates in real time (Aanderaa, 1974). This was a full decade after Rabin (1963) had shown that the second tape adds power. With time, especially following the introduction of the information-theoretic approach in (Paul et al., 1981), Aanderaa’s argument has become better understood and even extended to new results. In this paper, we present a clean version of the argument and some new extensions. The following four theorems summarize all the extensions we know about. All of them are lower bounds on the time required for on-line

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

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

[3]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

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

[5]  Janos Simon,et al.  Lower bounds on the time of probabilistic on-line simulations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  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).

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

[8]  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).

[9]  Nicholas Pippenger Probabilistic simulations (Preliminary Version) , 1982, STOC '82.

[10]  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 .

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

[12]  Stephen A. Cook,et al.  Space Lower Bounds for Maze Threadability on Restricted Machines , 1980, SIAM J. Comput..

[13]  Ming Li,et al.  Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.