论文信息 - Infinite Time Turing Machines

Infinite Time Turing Machines

We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Every set. for example, is decidable by such machines, and the semi-decidable sets form a portion of the sets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.

Joel David Hamkins | Andrew E. M. Lewis

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

[2] Solomon Feferman,et al. Incompleteness along paths in progressions of theories , 1962, Journal of Symbolic Logic.

[3] J. Earman,et al. Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes , 1993, Philosophy of Science.

[4] Jon Barwise. Admissible Set Theory , 1975 .

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

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

[7] J. F. Thomson,et al. Tasks and Super-Tasks , 1954 .

[8] Y. Moschovakis. Descriptive Set Theory , 1980 .

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

[10] M. Hogarth. Non-Turing Computers and Non-Turing Computability , 1994, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.