Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/infinite-time-turing-machines-jF8j5R5qZX
References (45)
-
M. Hogarth (1992)
Does general relativity allow an observer to view an eternity in a finite time?Foundations of Physics Letters, 5
-
J. Laraudogoitia (1996)
A Beautiful SupertaskMind, 105
-
(1962)
Buchi, Logic, Methodology and Philosophy and Science -
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
-
P. Welch (2000)
Eventually infinite time Turing machine degrees: infinite time decidable realsJournal of Symbolic Logic, 65
-
J. Copeland (1998)
Super Turing-Machines, Complexity, 4
-
B. Copeland (1998)
Super Turing-machinesComplex., 4
-
G. Sacks (1990)
Higher recursion theory -
J.R. Buchi (1962)
Proc.1960 Int.Congr. -
(2001)
I heard a version of this example in an email exchange with Peter Vallentyne in March -
J. Thomson (1954)
Tasks and Super-TasksAnalysis, 15
-
5. γ is admissible -
Philip Welch (2000)
The Length of Infinite Time Turing Machine ComputationsBulletin of the London Mathematical Society, 32
-
S. Feferman, Clifford Spector (1962)
Incompleteness along paths in progressions of theoriesJournal of Symbolic Logic, 27
-
B. Copeland, D. Proudfoot, Peter Farleigh, P. Catton, Chris Bullsmith, B. Russell, Ralph Blake (1998)
EVEN TURING MACHINES CAN COMPUTE UNCOMPUTABLE FUNCTIONS -
USA E-mail: [email protected] -
Y. Moschovakis (1980)
Descriptive Set Theory -
Cristian Calude, J. Casti, M. Dinneen (2002)
Unconventional Models of Computation, 2509
-
P. Welch (200b)
Journal of Symbolic Logic, 65
-
D. DuBose (1990)
The equivalence of determinacy and iterated sharpsJournal of Symbolic Logic, 55
-
(2002)
Accelerating Turing Machines, Minds and Machines (in press -
λ is a limit of clockable ordinals -
The halting problem h λ is not decidable -
P. Welch (1999)
Minimality Arguments for Infinite Time Turing DegreesSets and Proofs, 258
-
The authors can be reached at the following addresses -
Proof: (1 ↔ 2) This is clear, since there are no gaps in the writable ordinals, and certainly λ ≤ γ, since λ is the order-type of the clockable ordinals -
J. Hamkins, Andrew Lewis (1998)
Post's problem for supertasks has both positive and negative solutionsArchive for Mathematical Logic, 41
-
B. Löwe (2001)
Revision Sequences and Computers with an Infinite Amount of TimeJ. Log. Comput., 11
-
(1962)
Proc. 1960 Internat. Congr -
J. Earman, J. Norton (1993)
Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth SpacetimesPhilosophy of Science, 60
-
Notes 1. My research has been supported in part by grants from the CUNY Research Foundation and the National Science Foundation -
J. Earman (1995)
Bangs, Crunches, Whimpers, and Shrieks: Singularities and Acausalities in Relativistic Spacetimes -
J. Barwise (1975)
Admissible Set Theory -
P. Welch (1999)
Friedman's Trick: Minimality Arguments in the Infinite Time Turing Degrees -
C. Chihara (1965)
On the Possibility of Completing an Infinite ProcessThe Philosophical Review, 74
-
R.I. Soare (1987)
Recursively Enumerable Sets and Degrees -
J.D. Hamkins (2001)
Infinite Time Turing Machines With Only One TapeMathematical Logic Quarterly, 47
-
Infinite time Turing machines -
J. Hamkins, D. Seabold (1999)
Infinite Time Turing Machines With Only One TapeMath. Log. Q., 47
-
J. Earman (1995)
Bangs, Crunches, Whimpers and Shrieks: Singularities and Acausalities in Relativistic Spacetimes, Oxford University Press -
M. Hogarth (1994)
Non-Turing Computers and Non-Turing ComputabilityPSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, 1994
-
J. Earman (1995)
Bangs, Crunches, Whimpers, And Shrieks -
J.D. Hamkins (2000)
Infinite time Turing machinesThe Journal of Symbolic Logic, 65
-
Every clockable ordinal is writable -
G.E. Sacks (1990)
Higher Recursion Theory
- Publisher
- Springer Journals
- Copyright
- Copyright © 2002 by Kluwer Academic Publishers
- Subject
- Computer Science; Artificial Intelligence (incl. Robotics); Philosophy of Mind; Game Theory, Economics, Social and Behav. Sciences; Cognitive Psychology; Philosophy of Science; Theory of Computation
- ISSN
- 0924-6495
- eISSN
- 1572-8641
- DOI
- 10.1023/A:1021180801870
- Publisher site
- See Article on Publisher Site
Abstract
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.
Journal
Minds and Machines – Springer Journals
Published: Oct 4, 2004