Related papers: Turing's Landscape: decidability, computability an…
By nature, transmissible human knowledge is enumerable: every sentence, movie, audio record can be encoded in a sufficiently long string of 0's and 1's. The works of G\"odel, Turing and others showed that there are inherent limits and…
We broaden the domain of application of Brustein and de Alwis recent paper [1], where they introduce a (dynamical) selection principle on the landscape of string solutions using FRW quantum cosmology. More precisely, we (i) explain how…
A new framework is found for the compactification of supersymmetric string theory. It is shown that the massless spectra of Calabi--Yau manifolds of complex dimension $D_{crit}$ can be derived from noncritical manifolds of complex dimension…
We discuss different formulations and approaches to string theory and $ 2d$ quantum gravity. The generic idea to get a unique description of {\it many} different string vacua altogether is demonstrated on the examples in $ 2d$ conformal,…
In recent years there has been considerable interest in theories over string equations, length function, and string-number conversion predicate within the formal verification, software engineering, and security communities. SMT solvers for…
One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
A fundamental problem in contemporary string/M theory is to count the number of inequivalent vacua satisfying constraints in a string theory model. This article contains the first rigorous results on the number and distribution of…
This paper delves into the intersection of computational theory and music, examining the concept of undecidability and its significant, yet overlooked, implications within the realm of modern music composition and production. It posits that…
Complex Ricci-flat (i.e., Calabi-Yau) hypersurfaces in spaces admitting a maximal (toric) $U(1)^n$ gauge symmetry of general type (encoded by certain non-convex and multi-layered multitopes) may degenerate, but can be smoothed by rational…
In the recent times a lot of effort has been devoted to improve our knowledge about the space of string theory vacua (``the landscape'') to find statistical grounds to justify how and why the theory selects its vacuum. Particularly…
We discuss how, in a Universe restricted to the causal region connected to the observer, General Relativity implies the quantum nature of physical phenomena and directly leads to a string theory scenario, whose dynamics is ruled by a…
These notes contain, among others, a proof that the average running time of an easy solution to the satisfiability problem for propositional calculus is, under some reasonable assumptions, linear (with constant 2) in the size of the input.…
We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…
Methods for predicting material properties often rely on empirical models or approximations that overlook the fundamental topological nature of quantum interactions. We introduce a topological framework based on string theory and graph…
In this paper we describe ideas about the string landscape, and how to relate it to the physics of the Standard Model of particle physics. First, we give a short status report about heterotic string compactifications. Then we focus on the…
We explicitly construct and study the statistics of flux vacua for type IIB string theory on an orientifold of the Calabi-Yau hypersurface $P^4_{[1,1,2,2,6]}$, parametrised by two relevant complex structure moduli. We solve for these moduli…
We study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…
We investigate the most general phase space of configurations, consisting of all possible ways of assigning elementary attributes, ``energies'', to elementary positions, ``cells''. We discuss how this space possesses structures that can be…
Contents 1. Algebraicity criterion: statement 2. Proof of the algebraicity criterion. 3. Pseudoeffectivity and movable classes. 4. Harder-Narasimhan filtrations and pseudo-effectivity. 5. Pseudo-effectivity of relative canonical bundles. 6.…