Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 182

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Non-Turing Computers and Non-Turing Computability

Hogarth, Mark · 1994 · PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association

Abstract

Building on an idea by Pitowsky (1990), David Malament (private communications), Hogarth (1992) and Earman and Norton (1993) have shown how it is possible to perform computational supertasks—that is, an infinite number of computational steps in a finite span of time—in a kind of relativistic spacetime that Earman and Norton (1993) have dubbed a Malament-Hogarth spacetime. Definition 1 A spacetime (M,g) is Malament-Hogarth just when there is a future endless curve with past endpoint and a point q∊M such that . (Hereafter, the symbols “q” and “λ” are assumed to have the properties they have in Definition 1.1 shall also speak of a “λ-curve”.) Various examples of Malament-Hogarth (hereafter, M-H) spacetimes are given in Hogarth (1992), but the following artificial example from Earman and Norton (1993) is perhaps the simplest.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1086/psaprocbienmeetp.1994.1.193018

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 182

Metadata

Authors
Hogarth, M.
Venue
PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association
Published
1994
Volume
1994
Issue
1
Pages
126-138
ISSN
  • 0270-8647 (ISSN-L)
  • 2327-9486
OpenAlex
W2299867375
Cited by
182
References
2
FWCI
1.94
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: Non-Turing Computers and Non-Turing Computability. https://app.cochat.ai/papers/10.1086/psaprocbienmeetp.1994.1.193018
The paper
Hogarth, M. (1994). Non-Turing Computers and Non-Turing Computability. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association. https://doi.org/10.1086/psaprocbienmeetp.1994.1.193018

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.