Supertask Computation

Simple item page
dc.creatorHamkins, Joel David
dc.date2002-12-03
dc.date.accessioned2026-07-07T04:53:31Z
dc.date.available2026-07-07T04:53:31Z
dc.descriptionInfinite 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.
dc.description19 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.)
dc.identifierhttps://arxiv.org/abs/math/0212049
dc.identifierhttp://arxiv.org/abs/math/0212049
dc.identifierProceedings of the Foundations of the Formal Sciences III, Trends in Logic, Kluwer Academic Publishers, 2001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65877
dc.subjectLogic
dc.subject03D30; 03D60; 68Q05
dc.titleSupertask Computation
dc.typetext

Files

Collections

arXiv