Computational complexity of the landscape I

Details Computational complexity of the landscape I Computational complexity of the landscape I

2006-02-07

arxiv.org/abs/hep-th/0602072v2

AnnalsPhys.322:1096-1142,2007

Physics

High Energy Physics

High Energy Physics - Theory

JHEP3 Latex, 53 pp, 2 .eps figures

Scientific paper

10.1016/j.aop.2006.07.013

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.

Affiliated with

Also associated with

No associations

Rating

Computational complexity of the landscape I 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 Computational complexity of the landscape I, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational complexity of the landscape I will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63360