REVIEW 3 cited by
Computational complexity of the landscape I
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Computational complexity of the landscape I
read the original abstract
We study the computational complexity of the physical problem of finding vacua of string theory which agree with data, such as the cosmological constant, and show that such problems are typically NP hard. In particular, we prove that in the Bousso-Polchinski model, the problem is NP complete. We discuss the issues this raises and the possibility that, even if we were to find compelling evidence that some vacuum of string theory describes our universe, we might never be able to find that vacuum explicitly. In a companion paper, we apply this point of view to the question of how early cosmology might select a vacuum.
Forward citations
Cited by 3 Pith papers
-
Small Vacuum Energy and Tunneling in a Modified Bousso-Polchinski Model
In a wafer-modified Bousso-Polchinski model, 99.95% of the 532 million Calabi-Yau fourfold configurations in the Schöller-Skarke database allow vacuum energy spacings of 10^{-120} or smaller, with membrane nucleation ...
-
What to do with a Ricci-flat Calabi--Yau metric?
Numerical Ricci-flat Calabi–Yau metrics turn string compactifications from topological existence statements into computable geometries, unlocking normalized couplings, spectra, and metric-level tests of mirror symmetry.
-
What to do with a Ricci-flat Calabi--Yau metric?
A roadmap paper describing potential applications of numerical Ricci-flat Calabi-Yau metrics to heterotic string phenomenology and mathematical questions in special geometry.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.