The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Infinite time Turing machines
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Recursively Enumerable Sets and Degrees
Soare, R. I. (1987) · Perspectives in mathematical logic · doi:10.1007/978-3-662-02460-7 · Cited by 1,546
Recursively enumerable sets and degrees
Soare, R. I. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14552-2 · Cited by 1,520
Bangs, Crunches, Whimpers, And Shrieks: Singularities and Acausalities in Relativistic Spacetimes
Earman, J. (1995) · doi:10.1093/oso/9780195095913.001.0001 · Cited by 336
Bangs, crunches, whimpers, and shrieks: singularities and acausalities in relativistic spacetimes
(1996) · Choice Reviews Online · doi:10.5860/choice.33-5163 · Cited by 282
Non-Turing Computers and Non-Turing Computability
Hogarth, M. (1994) · PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association · doi:10.1086/psaprocbienmeetp.1994.1.193018 · Cited by 182
Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes
Earman, J., & Norton, J. D. (1993) · Philosophy of Science · doi:10.1086/289716 · Cited by 157
Does general relativity allow an observer to view an eternity in a finite time?
Hogarth, M. (1992) · Foundations of Physics Letters · doi:10.1007/bf00682813 · Cited by 130
The Physical Church Thesis and Physical Computational Complexity
Pitowsky, I. (1990) · Cited by 107
Cited by
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Metadata
- Authors
- Hamkins, J. D., & Lewis, A.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Published
- 2000-06
- Volume
- 65
- Issue
- 2
- Pages
- 567-604
- ISSN
- 0022-4812 (ISSN-L)
- 1943-5886
- OpenAlex
- W2571490773
- Cited by
- 261
- References
- 8
- FWCI
- 13.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Infinite time Turing machines. https://app.cochat.ai/papers/10.2307/2586556
- The paper
- Hamkins, J. D., & Lewis, A. (2000). Infinite time Turing machines. Journal of Symbolic Logic. https://doi.org/10.2307/2586556
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.