A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory (Q352683)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9152271151542664
0 references
0.790120542049408
0 references
0.761881411075592
0 references
0.7528893351554871
0 references
