Supertasks do not increase computational power

Oron Shagrir*

*Corresponding author for this work

Research output: Contribution to journalReview articlepeer-review

2 Scopus citations

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 languageAmerican English
Pages (from-to)51-58
Number of pages8
JournalNatural Computing
Volume11
Issue number1
DOIs
StatePublished - Mar 2012

Bibliographical note

Funding Information:
Acknowledgments Thanks to the participants of the Workshop on Physics and Computation at Ponta Delgada (2009) and to three anonymous referees for corrections and suggestions. This research was supported by the Israel Science Foundation, grant 725/08.

Keywords

  • Accelerating Turing machines
  • Halting function
  • Hyper computation
  • Relativistic machines
  • Supertasks
  • Turing machines

Cite this