Infinite Time Turing Machines: Supertask Computation

Simple item page
dc.creatorHamkins, Joel David
dc.date2002-12-03
dc.date.accessioned2026-07-07T04:53:30Z
dc.date.available2026-07-07T04:53:30Z
dc.descriptionInfinite 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.
dc.description25 pages. This is an expository account of infinite time Turing machines for a philosophical audience
dc.identifierhttps://arxiv.org/abs/math/0212047
dc.identifierhttp://arxiv.org/abs/math/0212047
dc.identifierMinds and Machines, vol. 12, no. 4, pp. 521--539, 2002. (special issue devoted to hypercomputation)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65875
dc.subjectLogic
dc.subject03D30; 03D60; 68Q05
dc.titleInfinite Time Turing Machines: Supertask Computation
dc.typetext

Files

Collections

arXiv