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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10773-012-1407-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10773-012-1407-0 / rank | |||
Normal rank | |||
Latest revision as of 15:10, 9 December 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
0 references
0 references
0 references
0 references
0 references
0 references
