4.4 KiB
[math/0209332] Hypercomputation: computing more than the Turing machine
We gratefully acknowledge support from
the Simons Foundation
and member institutions
arXiv.org > math > arXiv:math/0209332
All papers Titles Authors Abstracts Full text Help pages
(Help | Advanced search)
Full-text links:
Download:
(license)
Current browse context:
math
References & Citations
2 blog links
Bookmark
Mathematics > Logic
Title: Hypercomputation: computing more than the Turing machine
Authors: Toby Ord
(Submitted on 25 Sep 2002)
Abstract: Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation that can compute more than the Turing machine and addresses their implications. In this report, I survey much of the work that has been done on hypercomputation, explaining how such non-classical models fit into the classical theory of computation and comparing their relative powers. I also examine the physical requirements for such machines to be constructible and the kinds of hypercomputation that may be possible within the universe. Finally, I show how the possibility of hypercomputation weakens the impact of Godel's Incompleteness Theorem and Chaitin's discovery of 'randomness' within arithmetic.
| ----- |
| Comments: | 57 pages, 9 figures |
| Subjects: | Logic (math.LO); Other Computer Science (cs.OH); Mathematical Physics (math-ph) |
| MSC classes: | 03D10 (Primary) 68Q10, 68Q10, 68Q30 (Secondary) |
| Cite as: | arXiv:math/0209332 [math.LO] |
| | (or arXiv:math/0209332v1 [math.LO] for this version) |
Submission history
From: Toby Ord [view email]
[v1] Wed, 25 Sep 2002 18:07:00 GMT (764kb)
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Link back to: arXiv, form interface, contact.
[*MSC]: Mathematical Subject Classification