Undecidability in Spacetime Geometry via the AdS/CFT Correspondence
Sameer Ahmad Mir, Francesco Marino, Arshid Shabir, Lawrence M. Krauss, Mir Faizal
TL;DR
The paper shows that undecidability in spectral-gap problems for quantum many-body systems can be holographically transmitted to bulk geometry selection in AdS/CFT. By embedding a translationally invariant, undecidable spin Hamiltonian into a large-$N$ gauge theory, the dual AdS geometry competition between Poincaré AdS$_4$ and the AdS$_4$ soliton becomes undecidable, controlled by a halting predicate via an effective mass term $m_{ m eff}^2(u)=m^2+\Sigma_{\rm loop} + g_{\rm halt}$ with $g_{\rm halt}=\vartheta(u)\mu_h^2$. In the planar, strongly coupled regime, the dominant saddle is determined by the sign of $m_{ m eff}^2(u)$, yielding either gapless (Poincaré AdS$_4$) or gapped (AdS$_4$ soliton) phases, while the classical on-shell actions satisfy $I[g_P]=0$ and $I[\text{Sol}]<0$ in a low-temperature window; the halting bit fixes which saddle dominates, and no algorithm can determine this from the boundary data alone. This constitutes a Gödel–Turing obstruction to spacetime emergence under standard holographic assumptions (large $N_c$, large $\lambda$, classical gravity). The work suggests undecidability could be a pervasive feature of quantum gravity beyond this explicit construction.
Abstract
Undecidability, a hallmark of Gödel incompleteness theorems, has recently emerged in quantum many-body physics through the spectral gap problem. We demonstrate how this logical limitation can be holographically transmitted to a class of gravitational theories via the AdS/CFT correspondence. By embedding a translationally invariant spin Hamiltonian with undecidable gap status into a large-N gauge theory, we generate an AdS dual in which the selection of dominant bulk saddle (Poincaré AdS or AdS soliton) is itself undecidable. Consequently, under standard semiclassical holographic assumptions, even determining which smooth spacetime geometry emerges from quantum gravity can be beyond the limits of computability.
