Computational Cosmic Censorship

TL;DR

This paper formulates a computational perspective on weak cosmic censorship within AdS/CFT, showing that naked singularities entail infinite holographic complexity, thus operationally excluding them.

Contribution

It introduces a novel computational approach to cosmic censorship using holographic complexity, revealing divergence in complexity for naked singularities.

Findings

Bulk and boundary contributions are finite, but the Gibbons-Hawking-York term diverges at singularities.

Divergence occurs for geometries with near-origin scaling f(r) ~ a r^{-p} when p > D-3.

Naked singularities lead to infinite complexity, suggesting a computational form of censorship.

Abstract

We propose a computational formulation of weak cosmic censorship in AdS/CFT. Using the complexity=action proposal, we evaluate the Wheeler-DeWitt action for overcharged Reissner- Nordstr\"om-AdS spacetimes containing naked timelike singularities. We show that the bulk, null, and joint contributions remain finite, while the Gibbons-Hawking-York term at the singularity diverges. More generally, for any static and spherically symmetric geometry with near-origin scaling $f(r)\sim a r^{-p}$, the singularity term diverges whenever $p>D-3$. This implies divergent holographic complexity and, even relative to the logarithmically divergent extremal charged sector, leaves an infinite complexity gap. This suggests an operational form of censorship: naked singularities are excluded not by geometry alone, but by an infinite computational cost arising from their local near-singularity structure.