General relativistic hypercomputing and foundation of mathematics
DOI10.1007/S11047-009-9114-3zbMATH Open1192.68258OpenAlexW2016555353MaRDI QIDQ734209FDOQ734209
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
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
Black holesCosmologyBlue-shift problemChurch ThesisChurch-Thuring barrierEvaporation of black holesFoundations of mathematicsGeneral relativity theoryHilbert programmeHypercomputationKerr-Newman spacetimesMalament-Hogarth spacetimeRelativistic computationSupertasks
Cites Work
- Deciding Arithmetic Using SAD Computers
- Non-Turing computations via Malament--Hogarth space-times
- Title not available (Why is that?)
- General Relativity
- Note on a reformulation of the strong cosmic censor conjecture based on computability
- The Extent of Computation in Malament–Hogarth Spacetimes
- Twin paradox and the logical foundation of relativity theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatizing relativistic dynamics without conservation postulates
- Relativistic computers and the Turing barrier
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
- Title not available (Why is that?)
- Title not available (Why is that?)
- A twist in the geometry of rotating black holes: seeking the cause of acausality
Cited In (13)
- SOFSEM 2006: Theory and Practice of Computer Science
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
- Title not available (Why is that?)
- 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
- Logical Approaches to Computational Barriers
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)
