图灵景观：弦论中的可判定性、可计算性和复杂性
Turing's Landscape: decidability, computability and complexity in string theory
摘要：
我认为，算法的可判定性，可计算性和复杂性的问题应该发挥更大的作用，在决定“最终”的理论描述的景观字符串真空。更具体地说，我检查的概念的平均排名的（统一）规范组的景观，明确建设的Ricci平坦度量的卡-丘流形以及可计算性的基本时期，以表明不可判定性问题是更普遍的比描述的工作Denef和道格拉斯。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
