On time hierarchies

Authors:
W. J. Paul
Affiliations:
-
Venue:
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Year:
1977

Citing 3
Cited 2

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Komplexität von Entscheidungsproblemen, Ein Seminar

Komplexität von Entscheidungsproblemen, Ein Seminar
Space bounds for a game on graphs

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Separating Nondeterministic Time Complexity Classes

Journal of the ACM (JACM)
The tight deterministic time hierarchy

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For fixed k ≥ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ≥ 2 we exhibit infinite hierarchies of languages recognizable by k-tape machines with increasing amount of time on the same amount of space.