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

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

2009-09-10

arxiv.org/abs/0909.1869v1

Physics

High Energy Physics

High Energy Physics - Theory

10 pages, entry for the 2009 FQXI Essay Contest

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Turing's Landscape: decidability, computability and complexity in string theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Turing's Landscape: decidability, computability and complexity in string theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turing's Landscape: decidability, computability and complexity in string theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131202