Zeno machines and hypercomputation

Details Zeno machines and hypercomputation Zeno machines and hypercomputation

2004-12-06

arxiv.org/abs/cs/0412022v3

Computer Science

Computational Complexity

11 pages. First submitted in December 2004, substantially revised in July and in November 2005. To appear in Theoretical Compu

Scientific paper

This paper reviews the Church-Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of "hypercomputation", concentrating on perhaps the most straight-forward option: Zeno machines (Turing machines with accelerating clock). The halting problem is briefly discussed in a general context and the suggestion that it is an inevitable companion of any reasonable computational model is emphasised. It is hinted that claims to have "broken the Turing barrier" could be toned down and that the important and well-founded role of Turing computability in the mathematical sciences stands unchallenged.

Affiliated with

Also associated with

No associations

Rating

Zeno machines and hypercomputation 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 Zeno machines and hypercomputation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zeno machines and hypercomputation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40841