Related papers: Turing's Landscape: decidability, computability an…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
Recently, string theory on Calabi--Yau manifolds was constructed and was shown to be a fully consistent, space--time supersymmetric string theory. The physically interesting case is the case of three generations. Intriguingly, it appears at…
This paper is the extended version of On the Complexity of Infinite Advice Strings (ICALP 2018). We investigate a notion of comparison between infinite strings. In a general way, if M is a computation model (e.g. Turing machines) and C a…
In recent work N. Hitchin introduced the concept of "generalised geometry". The key feature of generalised structures is that that they can be acted on by both diffeomorphisms and 2-forms, the so-called $B$-fields. In this lecture, we give…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…
We approach string phenomenology from the perspective of computational algebraic geometry, by providing new and efficient techniques for proving stability and calculating particle spectra in heterotic compactifications. This is done in the…
We analyze the phase structure of topological Calabi--Yau manifolds defined on the moduli space of instantons. We show in this framework that topological vacua describe new phases of the Heterotic String theory in which the flat directions…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
General relativity treats spacetime as dynamical and exhibits its breakdown at singularities. This failure is interpreted as evidence that quantum gravity is not a theory formulated within spacetime; instead, it must explain the very…
Calabi-Yau spaces, or Kahler spaces admitting zero Ricci curvature, have played a pivotal role in theoretical physics and pure mathematics for the last half-century. In physics, they constituted the first and natural solution to…
We demonstrate that the problems of finding stable or metastable vacua in a low energy effective field theory requires solving nested NP-hard and co-NP-hard problems, while the problem of finding near-vacua is in P. Multiple problems…
We consider superstring compactifications where both the classical description, in terms of a Calabi-Yau manifold, and also the quantum theory is known in terms of a Landau-Ginzburg orbifold model. In particular, we study (smooth)…
We study the fundamental issue of decidability of satisfiability over string logics with concatenations and finite-state transducers as atomic operations. Although restricting to one type of operations yields decidability, little is known…
In some string theories, e.g. SO(32) heterotic string theory on Calabi-Yau manifolds, a massless field with a tree level potential can acquire a tachyonic mass at the one loop level, forcing us to quantize the theory around a new background…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…