On time hierarchies
W. J. Paul · 1977
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.