Hypercomputation: computing more than the Turing machine

Details Hypercomputation: computing more than the Turing machine Hypercomputation: computing more than the Turing machine

2002-09-25

arxiv.org/abs/math/0209332v1

Mathematics

Logic

57 pages, 9 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hypercomputation: computing more than the Turing machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hypercomputation: computing more than the Turing machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypercomputation: computing more than the Turing machine will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366842