Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 51-58 |
Number of pages | 8 |
Journal | Natural Computing |
Volume | 11 |
Issue number | 1 |
DOIs | |
State | Published - Mar 2012 |
Keywords
- Accelerating Turing machines
- Halting function
- Hyper computation
- Relativistic machines
- Supertasks
- Turing machines
All Science Journal Classification (ASJC) codes
- Computer Science Applications