Turing's Landscape: decidability, computability and complexity in string theory
arXiv:0909.1869
Abstract
I argue that questions of algorithmic decidability, computability and complexity should play a larger role in deciding the "ultimate" theoretical description of the Landscape of string vacua. More specifically, I examine the notion of the average rank of the (unification) gauge group in the Landscape, the explicit construction of Ricci-flat metrics on Calabi-Yau manifolds as well as the computability of fundamental periods to show that undecidability questions are far more pervasive than that described in the work of Denef and Douglas.
10 pages, entry for the 2009 FQXI Essay Contest
References in corpus (6)
- String Theory on Calabi-Yau Manifolds
- Computational complexity of the landscape I
- Landscape Cartography: A Coarse Survey of Gauge Group Rank and Stabilization of the Proton
- A Finite Landscape?
- Multiple Mellin-Barnes Integrals as Periods of Calabi-Yau Manifolds With Several Moduli
- Periods and Igusa Zeta functions