Supertask Computation

Details Supertask Computation Supertask Computation

2002-12-03

arxiv.org/abs/math/0212049v1

Proceedings of the Foundations of the Formal Sciences III, Trends in Logic, Kluwer Academic Publishers, 2001

Mathematics

Logic

19 pages. This is the text of a talk I gave for the conference on the Foundations of the Formal Sciences III, held in Vienna,

Scientific paper

Infinite time Turing machines extend the classical Turing machine concept to
transfinite ordinal time, thereby providing a natural model of infinitary
computability that sheds light on the power and limitations of supertask
algorithms.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496351