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

Infinite Time Turing Machines: Supertask Computation

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

paper · pdf

published as Minds and Machines, vol. 12, no. 4, pp. 521--539, 2002. (special issue devoted to hypercomputation) · 25 pages. This is an expository account of infinite time Turing machines for a philosophical audience

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

Abstract

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.

Related