A note on accelerated Turing machines

@article{Calude2010ANO,
  title={A note on accelerated Turing machines},
  author={Cristian S. Calude and Ludwig Staiger},
  journal={Mathematical Structures in Computer Science},
  year={2010},
  volume={20},
  pages={1011-1017}
}
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. 1. ACCELERATED TURING MACHINES An accelerated Turing machine (sometimes called… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Email to (and discussions

L. Fearnley
with) C. Calude, • 2008
View 3 Excerpts

Zeno machines and hypercomputation

Theor. Comput. Sci. • 2006
View 3 Excerpts

Super-tasks

O. Shagrir
accelerating Turing machines and uncomputability, Theoretical Computer Science, 317 • 2004
View 2 Excerpts

Accelerating Turing Machines

Minds and Machines • 2002
View 2 Excerpts

J

J. Wiedermann
van Leeuwen. Relativistic computers and non-uniform complexity theory, in C. S. Calude, M. J. Dinneen, F. Peper (eds.). Unconventional Models of Computation, Lecture Notes Comput. Sci. 2509, Springer-Verlag, Heidelberg • 2002
View 1 Excerpt

Similar Papers

Loading similar papers…