CoChat

Non-Turing Computations Via Malament–Hogarth Space-Times

Open access
Etesi, Gábor, Németi, István · 2002 · International Journal of Theoretical Physics
Cited by 225

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

Abstract

We investigate the Church–Kalmár–Kreisel–Turing theses theoretical concerning (necessary) limitations of future computers and of deductive sciences, in view of recent results of classical general relativity theory. We argue that (i) there are several distinguished Church–Turing-type theses (not only one) and (ii) validity of some of these theses depend on the background physical theory we choose to use. In particular, if we choose classical general relativity theory as our background theory, then the above-mentioned limitations (predicted by these theses) become no more necessary, hence certain forms of the Church–Turing thesis cease to be valid (in general relativity). (For other choices of the background theory the answer might be different.) We also look at various “obstacles” to computing a nonrecursive function (by relying on relativistic phenomena) published in the literature and show that they can be avoided (by improving the “design” of our future computer). We also ask ourselves, how all this reflects on the arithmetical hierarchy and the analytical hierarchy of uncomputable functions.

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.1023/a:1014019225365

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 225

Metadata

Authors
Etesi, G., & Németi, I.
Venue
International Journal of Theoretical Physics
Published
2002-02
Volume
41
Issue
2
Pages
341-370
ISSN
  • 0020-7748 (ISSN-L)
  • 1572-9575
OpenAlex
W1874721034
Cited by
225
References
2
FWCI
14.42
Type
journal article
Language
en
Open access
green

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 Computations Via Malament–Hogarth Space-Times. https://app.cochat.ai/papers/10.1023/a:1014019225365
The paper
Etesi, G., & Németi, I. (2002). Non-Turing Computations Via Malament–Hogarth Space-Times. International Journal of Theoretical Physics. https://doi.org/10.1023/a%3A1014019225365

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.