Infinite Time Turing Machines: Supertask Computation
Joel David Hamkins · arXiv (Cornell University) · 2002
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.