Computability and logic
Theoretical Computer Science
Handbook of formal languages, vol. 3
Minds and Machines
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Blackwell Guide to the Philosophy of Computing and Information
Blackwell Guide to the Philosophy of Computing and Information
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Zeno machines and hypercomputation
Theoretical Computer Science
Structural Complexity I
Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
Supertasks do not increase computational power
Natural Computing: an international journal
Some transfinite generalisations of gödel's incompleteness theorem
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Membrane system models for super-Turing paradigms
Natural Computing: an international journal
| Hi-index | 0.00 |
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 of languages accepted by accelerated Turing machines are the closure under Boolean operations of the sets Σ1 and Σ2.