论文信息 - Infinite Time Turing Machines: Supertask Computation

Infinite Time Turing Machines: Supertask Computation

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.

Joel David Hamkins

[1] M. Hogarth. Does general relativity allow an observer to view an eternity in a finite time? , 1992 .

[2] G. Sacks. Higher recursion theory , 1990 .

[3] John Earman,et al. Bangs, Crunches, Whimpers, and Shrieks: Singularities and Acausalities in Relativistic Spacetimes , 1995 .

[4] Philip D. Welch,et al. The Length of Infinite Time Turing Machine Computations , 2000 .

[5] R. Soare. Recursively enumerable sets and degrees , 1987 .