vix.ing · top · new · best · stats · spec

Supertask Computation

2002/12/03 by Joel David Hamkins
Mathematics · #math.LO #msc:03D30 #msc:03D60 #msc:68Q05

paper · pdf

published as Proceedings of the Foundations of the Formal Sciences III, Trends in Logic, Kluwer Academic Publishers, 2001 · 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.)

arxiv created 2002/12/03 · arxiv updated 2009/11/30

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.

Related