A note on accelerated Turing machines

ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in accelerated mode. We also propose two ways to define the language accepted by an accelerated Turing machine. Accordingly, the classes of languages accepted by accelerated Turing machines are the closure under Boolean operations of the sets Σ1 and Σ2.

• Type: Journal
• Year: 2010
• Where: MSCS
• Authors: Cristian S. Calude, Ludwig Staiger
• Keywords: Accelerated Turing, Accelerated Turing Machine, MSCS 2010, Turing Machine