Infinite Time Turing Machines: Supertask Computation
arXiv:math/0212047
Abstract
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.
25 pages. This is an expository account of infinite time Turing machines for a philosophical audience