Answers are grounded in this paper and cite their sources.
It is shown that every deterministic multitape Turing machine of time complexity t ( n ) can be simulated by a deterministic Turing machine of tape complexity t ( n )/log t ( n ). Consequently, for tape constructable t ( n ), the class of languages recognizable by multitape Turing machines of time complexity t ( n ) is strictly contained in the class of languages recognized by Turing machines of tape complexity t ( n ). In particular the context-sensitive languages cannot be recognized in linear time by deterministic multitape Turing machines.
No takes yet. Share an insight, caveat, or question.
Hopcroft et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: