2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/65877Infinite 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.)Logic03D30; 03D60; 68Q05Supertask Computationtext