We find that the weak topological coupling OSV conjecture can be true at most in a special chamber of the K"ahler cone.
Computing over the reals: In Section 1 we also discuss the alternative Blum-Shub-Smale model. In the final section we d In the final section we discuss the issue of whether physical systems could defeat the Church-Turing Thesis.
This provides further motivation for exploring the computability and computational complexity of physical problems in the bit model. The Church-Turing thesis CTin its common interpretation, is the belief that the Turing machine, which is computationally equivalent to the common computer, is the most general model of computati Computational complexity of the landscape by Frederik Denef, Michael R.
Douglas - I " 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 comple 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.
Contents Show Context Citation Context Namely, if it is so difficult for us to find candidate string theory vacua, then how did the universe do it?
Authors: Frederik Denef, Gregory W. Moore (Submitted on 18 Feb (v1), last revised 18 Jun (this version, v2)) Abstract: We investigate degeneracies of BPS states of D-branes on compact Calabi-Yau manifolds. Thoughts on Future Landscapes Frederik Denef Dec 2, String Data Workshop Northeastern University. But Timm Wrase, who had already dealt with similar questions in his doctoral thesis, found that this idea cannot be the whole truth either. "Cumrun Vafa's conjecture, which prohibits certain types.
On the other hand, according to standard cosmology, the universe settled On the complexity of real functions by Mark Braverman" We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach.
We then use the connection to develop a notion of computability and complexity of functions over the reals that can be viewed as an We then use the connection to develop a notion of computability and complexity of functions over the reals that can be viewed as an extension of both models.
There are different approaches that have been proved to yield equiv We discuss combining physical experiments with machine computations and introduce a form of analogue-digital Turing machine.
We examine in detail a case study where an experimental procedure based on Newtonian kinematics is combined with a class of Turing machines. Three forms of analogue-digital ma Three forms of analogue-digital machine are studied, in which physical parameters can be set exactly and approximately.
Using non-uniform complexity theory, and some probability, we prove theorems that show that these machines can compute more than classical Turing machines. We assume the reader is familiar with our . Computational Complexity of Euclidean Sets: We investigate different definitions of the computability and complexity of sets in R k, and establish new connections between these definitions.Submit Your Rutgers Thesis or Dissertation (RUetd) Collections.
SOAR (Scholarly Open Access at Rutgers) RUetd (Rutgers Electronic Theses and Dissertations) Search Portals to Specific Collections; Digital Exhibitions; BPS states in string theory. Identifier.
ETD_ Identifier (type = hdl). According to our current on-line database, Frederik Denef has 1 student and 1 descendant. We welcome any additional information. If you have additional information or corrections regarding this mathematician, please use the update form.
Thesis advisor Author Andrew Strominger Gim Seng Ng Aspects of Symmetry in de Sitter Space Thanks also go to Frederik Denef, Xi Yin and Cumrun Vafa from whom I have learned many things about black holes, cosmology and string theories.
I’m also thankful .
fearless leader, Frederik Denef, for teaching me that happiness is a choice. • My wife, Lauren Merrill, for whom any blurb of an acknowledgement would be an understatement of incredible proportions.
Teaching. Information for Physics , Spring Information for Physics , Fall Information for Physics , Fall Information for Physics , Fall by Frederik Denef, Michael R. Douglas - I Abstract: 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.