General relativistic hypercomputing and foundation of mathematics

DOI10.1007/S11047-009-9114-3MaRDI QIDQ734209zbMATH OpenOpenAlexFDO

Authors Péter Németi, Hajnal Andréka, István Németi

Publication date 19 October 2009

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-009-9114-3

zbMATH Keywords

Black holesCosmologyBlue-shift problemChurch ThesisChurch-Thuring barrierEvaporation of black holesFoundations of mathematicsGeneral relativity theoryHilbert programmeHypercomputationKerr-Newman spacetimesMalament-Hogarth spacetimeRelativistic computationSupertasks

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Relativistic Computers and Transfinite Computation
• The significance of relativistic computation for the philosophy of mathematics
• scientific article; zbMATH DE number 3911237
• Hypernumbers and relativity
• Generalized Hyperarithmetic Theory
• Symbolic computation in relativity theory
• Computation, hypercomputation, and physical science
• Relativizing relativized computations
• scientific article; zbMATH DE number 2013816
• On the relation between mathematical and numerical relativity

Cites work

• scientific article; zbMATH DE number 1687054 (Why is no real title available?)
• scientific article; zbMATH DE number 3144511 (Why is no real title available?)
• scientific article; zbMATH DE number 5168268 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1195807 (Why is no real title available?)
• scientific article; zbMATH DE number 2013816 (Why is no real title available?)
• scientific article; zbMATH DE number 1909823 (Why is no real title available?)
• A twist in the geometry of rotating black holes: seeking the cause of acausality
• Axiomatizing relativistic dynamics without conservation postulates
• Deciding Arithmetic Using SAD Computers
• General Relativity
• Logical Approaches to Computational Barriers
• Non-Turing computations via Malament--Hogarth space-times
• Note on a reformulation of the strong cosmic censor conjecture based on computability
• Relativistic computers and the Turing barrier
• The Extent of Computation in Malament–Hogarth Spacetimes
• Twin paradox and the logical foundation of relativity theory

Cited in

(13)

• Logical Approaches to Computational Barriers
• Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
• SOFSEM 2006: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 2013816 (Why is no real title available?)
• Towards formal verification of computations and hypercomputations in relativistic physics
• Non-Turing computations via Malament--Hogarth space-times
• Existence of faster than light signals implies hypercomputation already in special relativity
• Physical computability theses
• Relativistic computers and the Turing barrier
• Supertasks do not increase computational power
• The significance of relativistic computation for the philosophy of mathematics
• A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer
• Theory of quantum computation and philosophy of mathematics. II

This page was built for publication: General relativistic hypercomputing and foundation of mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734209)