A note on accelerated Turing machines

In this paper we prove that any Turing machine that uses only a finite computational space for every input cannot solve an uncomputable problem even when it runs in accelerated mode. We also propose two ways to define the language accepted by an accelerated Turing machine. Accordingly, the classes o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical structures in computer science 2010-12, Vol.20 (6), p.1011-1017
Hauptverfasser:	CALUDE, CRISTIAN S., STAIGER, LUDWIG
Format:	Artikel
Sprache:	eng
Schlagworte:	Boolean algebra Computation Computer science Mathematical analysis Mathematical models Turing machines
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!