Infinite Time Turing Machines: Supertask Computation
逻辑
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0212047,
title = {Infinite Time Turing Machines: Supertask Computation},
author = {Joel David Hamkins},
journal= {arXiv preprint arXiv:math/0212047},
year = {2007}
}
备注
25 pages. This is an expository account of infinite time Turing machines for a philosophical audience