Sciweavers

MSCS
2010
104views more  MSCS 2010»
13 years 9 months ago
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 a...
Cristian S. Calude, Ludwig Staiger