Complexity - Special issue on uncoventional models of computation
Minds and Machines
Minds and Machines
Minds and Machines
Physical Hypercomputation and the Church–Turing Thesis
Minds and Machines
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Accelerating machines: a review
International Journal of Parallel, Emergent and Distributed Systems
General relativistic hypercomputing and foundation of mathematics
Natural Computing: an international journal
Output concepts for accelerated Turing machines
Natural Computing: an international journal
A note on accelerated turing machines
Mathematical Structures in Computer Science
Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
| Hi-index | 0.00 |
It is generally assumed that supertasks increase computational power. It is argued, for example, that supertask machines can compute beyond the Turing limit, e.g., compute the halting function. We challenge this assumption. We do not deny that supertask machines can compute beyond the Turing limit. Our claim, rather, is that the (hyper) computational power of these machines is not related to supertasks, but to the "right kind" of computational structure.