Turing's Landscape: decidability, computability and complexity in string theory Export

@article{citeulike:5772217, 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.}, archivePrefix = {arXiv}, author = {Rej, Abhijnan}, citeulike-article-id = {5772217}, citeulike-linkout-0 = {http://arxiv.org/abs/0909.1869}, citeulike-linkout-1 = {http://arxiv.org/pdf/0909.1869}, day = {10}, eprint = {0909.1869}, keywords = {complexity, computability, decidability, string\_landscape}, month = {Sep}, posted-at = {2009-09-11 13:15:54}, priority = {2}, title = {Turing's Landscape: decidability, computability and complexity in string theory}, url = {http://arxiv.org/abs/0909.1869}, year = {2009} }

TY - JOUR ID - citeulike:5772217 L3 - citeulike-article-id:5772217 N2 - 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. TI - Turing's Landscape: decidability, computability and complexity in string theory KW - complexity KW - computability KW - decidability KW - string_landscape AU - Rej, Abhijnan PY - 2009/Sep/10/ UR - http://arxiv.org/abs/0909.1869 ER -