A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory (Q352683): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q122897384, #quickstatements; #temporary_batch_1707149277123 |
Removed claim: author (P16): Item:Q166083 |
||
| Property / author | |||
| Property / author: Gábor Etesi / rank | |||
Revision as of 00:32, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory |
scientific article |
Statements
A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory (English)
0 references
5 July 2013
0 references
strong cosmic censorship
0 references
Malament-Hogarth space-times
0 references
Church-Turing thesis
0 references
