Infinite Time Turing Machines: Supertask Computation

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages. This is an expository account of infinite time Turing machines for a philosophical audience

Scientific paper

Infinite time Turing machines extend the operation of ordinary Turing
machines into transfinite ordinal time. By doing so, they provide a natural
model of infinitary computability, a theoretical setting for the analysis of
the power and limitations of supertask algorithms.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-496344

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.