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.

We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Turing machines (that receive their input on their work tape) require time Q(n 2 ) to powerful than deterministic linear time. We also recognize non-palindromes of length n (it is easy to discuss the prospects for extending this result to see that time O(n log n) is. sufficient for a more general Turing machines. non-deterministic machine).

Supplementary data are available at Bioinformatics online.

No abstract

No abstract

No abstract

No abstract

No abstract