Note on a reformulation of the strong cosmic censor conjecture based on computability

DOI10.1016/S0370-2693(02)02966-0zbMath1001.83069arXivgr-qc/0207086WikidataQ123013508 ScholiaQ123013508MaRDI QIDQ1850416

Gábor Etesi

Publication date: 3 December 2002

Published in: Physics Letters. B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/gr-qc/0207086

zbMATH Keywords

Malament-Hogarth space-timesnon-Turing computationsZFC set theory consistency

Mathematics Subject Classification ID

Relativistic cosmology (83F05)

Related Items (4)

A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory ⋮ Relativistic computers and the Turing barrier ⋮ Zeno machines and hypercomputation ⋮ General relativistic hypercomputing and foundation of mathematics

Cites Work

• The Large Scale Structure of Space-Time
• General Relativity
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: Note on a reformulation of the strong cosmic censor conjecture based on computability