Deterministic Turing Machines in the Range between Real-Time and Linear-Time

Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form n + r(n) where r o(n) is a sublinear function. It is shown that there exist infinite time hierarchies of separated complexity classes in that range. For these classes weak closure properties are proved. Key words: Turing machines, automata, computational complexity, time hierarchies, fast computations, closure properties, speed-up

• Type: Journal
• Year: 2000
• Where: ECCC
• Authors: Andreas Klein, Martin Kutrib
• Keywords: Closure Properties, ECCC 2000, Separated Input Tape, Time Hierarchies