Supertask Computation
arXiv:math/0212049
Abstract
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.
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, September, 2001. (The logo on the cover page is incorrect.)