Non-Turing Computations Via Malament–Hogarth Space-Times
Open accessThe DOI matches its Crossref record; 15 of the 15 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.
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
The Large Scale Structure of Space-Time
Hawking, S. W., & Ellis, G. F. R. (1973) · doi:10.1017/cbo9780511524646 · Cited by 10,624
Wald, R. M. (1984) · doi:10.7208/chicago/9780226870373.001.0001 · Cited by 7,188
Wald, R. M. (1984) · Cited by 6,274
Computability in Analysis and Physics
Pour-El, M. B., & Richards, J. I. (1989) · Perspectives in Mathematical Logic · doi:10.1007/978-3-662-21717-7 · Cited by 920
Internal structure of black holes
Poisson, E., & Israel, W. (1990) · Physical Review D · doi:10.1103/physrevd.41.1796 · Cited by 673
Inner structure of a charged black hole: An exact mass-inflation solution
Ori, A. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.789 · Cited by 353 · cited 2×
“A more careful analysis of the situation was carried out by Ori [21][22] in the case of the Reissner–Nordstr¨om black hole and partially in the case of the Kerr–Newman black hole, however.”
BackgroundMethodBangs, Crunches, Whimpers, And Shrieks: Singularities and Acausalities in Relativistic Spacetimes
Earman, J. (1995) · doi:10.1093/oso/9780195095913.001.0001 · Cited by 336
Church's Thesis and Principles for Mechanisms
(1980) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)71257-6 · Cited by 331
The geometry of Kerr black holes
O’Neill, B. (1995) · Cited by 309
Hamkins, J. D., & Lewis, A. (2000) · Journal of Symbolic Logic · doi:10.2307/2586556 · Cited by 261
Cited by
(2002) · Springer eBooks · doi:10.1007/978-1-4471-0129-1 · Cited by 298
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
A Computability Argument Against Superintelligence
Wiedermann, J. (2012) · Cognitive Computation · doi:10.1007/s12559-012-9124-9 · Cited by 12
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
- 15
- 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
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.