Chapter

Classical and New Paradigms of Computation and their Complexity Hierarchies

Volume 23 of the series Trends in Logic pp 141-158

Supertask computation

  • Joel David HamkinsAffiliated withMathematics Program, The Graduate Center of The City University of New York

* Final gross prices may vary according to local VAT.

Get Access

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.