Journal of the ACM (JACM)
Probabilistic computation and linear time
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Machine models and linear time complexity
ACM SIGACT News
Turing Award lecture: it's time to reconsider time
Communications of the ACM
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Locality preserving dictionaries: theory & application to clustering in databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational Complexity of One-Tape Turing Machine Computations
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
Sorting sequential files with limited auxiliary storage
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The tight deterministic time hierarchy
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Relations between diagonalization, proof systems, and complexity gaps
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
An information-theoretic approach to time bounds for on-line computation (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Time-bounded random access machines
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
A hierarchy for nondeterministic time complexity
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Variations on pushdown machines (Detailed Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
Language compression and pseudorandom generators
Computational Complexity
SIGACT news complexity theory column 52
ACM SIGACT News
Turing award lecture: it's time to reconsider time
ACM Turing award lectures
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Journal of Computer and System Sciences
Deterministic multitape automata computations
Journal of Computer and System Sciences
Time-restricted sequence generation
Journal of Computer and System Sciences
Time bounded random access machines
Journal of Computer and System Sciences
A hierarchy for nondeterministic time complexity
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Diagonalization strikes back: some recent lower bounds in complexity theory
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Improved simulation of nondeterministic Turing machines
Theoretical Computer Science
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Time complexity of tape reduction for reversible turing machines
RC'11 Proceedings of the Third international conference on Reversible Computation
Functionals Using Bounded Information and the Dynamics of Algorithms
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 0.02 |
It has long been known that increasing the number of tapes used by a Turing machine does not provide the ability to compute any new functions. On the other hand, the use of extra tapes does make it possible to speed up the computation of certain functions. It is known that a square factor is sometimes required for a one-tape machine to behave as a two-tape machine and that a square factor is always sufficient.The purpose of this paper is to show that, if a given function requires computation time T for a k-tape realization, then it requires at most computation time T log T for a two-tape realization. The proof of this fact is constructive; given any k-tape machine, it is shown how to design an equivalent two-tape machine that operates within the stated time bounds. In addition to being interesting in its own right, the trade-off relation between number of tapes and speed of computation can be used in a diagonalization argument to show that if T(n) and U(n) are two time functions such that inf T(n) log T(n) ÷ U(n) = 0 then there exists a function that can be computed within the time bound U(n) but not within the time bound T(n).