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