Related papers: Turing's Landscape: decidability, computability an…
Data Science and Machine learning have been growing strong for the past decade. We argue that to make the most of this exciting field we should resist the temptation of assuming that forecasting can be reduced to brute-force data analytics.…
Motivated by recent developments in the computation of periods for string compactifications with $c=9$, we develop a complementary method which also produces a convenient basis for related calculations. The models are realized as…
While Calabi-Yau hypersurfaces in toric ambient spaces provide a huge number of examples, theoretical considerations as well as applications to string phenomenology often suggest a broader perspective. With even the question of finiteness…
Incorporating constraints is a major concern in probabilistic machine learning. A wide variety of problems require predictions to be integrated with reasoning about constraints, from modelling routes on maps to approving loan predictions.…
The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
Recent results on duality between string theories and connectedness of their moduli spaces seem to go a long way toward establishing the uniqueness of an underlying theory. For the large class of Calabi-Yau 3-folds that can be embedded as…
In this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems. The…
Topological transitivity is a fundamental notion in topological dynamics and is widely regarded as a basic indicator of global dynamical complexity. For general cellular automata, topological transitivity is known to be undecidable. By…
We demonstrate a first-principle analysis of the string theory landscapes in the framework of non-critical string/matrix models. In particular, we discuss non-perturbative instability, decay rate and the true vacuum of perturbative string…
We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…
Turing's (1936) paper on computable numbers has played its role in underpinning different perspectives on the world of information. On the one hand, it encourages a digital ontology, with a perceived flatness of computational structure…
Let K be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map.…
In this work we provide a self-contained and modern introduction to some of the tools, obstacles and open questions arising in string compactifications. Techniques and current progress are illustrated in the context of smooth heterotic…
The most general gauge-invariant marginal deformation of four-dimensional abelian BF-type topological field theory is studied. It is shown that the deformed quantum field theory is topological and that its observables compute, in addition…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
This review talk focusses on some of the interesting developments in the area of superstring compactification that have occurred in the last couple of years. These include the discovery that ``mirror symmetric" pairs of Calabi--Yau spaces,…
We study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extensions, the model-checking problem is undecidable, but we show…
Much has been learned about string theory over the last few years by studying properties of cycles and branes in a given background geometry. Here we discuss three situations (quantum volume, attractor flows/D-brane stability, and dynamical…
We discuss the extent to which numerical techniques for computing approximations to Ricci-flat metrics can be used to investigate hierarchies of curvature scales on Calabi-Yau manifolds. Control of such hierarchies is integral to the…