Related papers: On Church's Thesis in Cubical Assemblies

We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a…

Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers. A fundamental…

No-cloning theorem says that there is no unitary operation that makes perfect clones of non-orthogonal quantum states. The objective of the present paper is to examine whether an imperfect cloning operation exists or not in a C*-algebraic…

Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…

In previous work, the first three authors conjectured that the ring of regular functions on a natural class of affine log Calabi-Yau varieties (those with maximal boundary) has a canonical vector space basis parameterized by the integral…

In this paper, we show that Markov's principle is not derivable in dependent type theory with natural numbers and one universe. One way to prove this would be to remark that Markov's principle does not hold in a sheaf model of type theory…

We exhibit a computational type theory which combines the higher-dimensional structure of cartesian cubical type theory with the internal parametricity primitives of parametric type theory, drawing out the similarities and distinctions…

A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

We study full exact functors between triangulated categories. With some hypotheses on the source category we prove that it admits an orthogonal decomposition into two pieces such that the functor restricted to one of them is zero while the…

It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of…

We give an uncountability proof of the reals which relies on their order completeness instead of their sequential completeness. We use neither a form of the axiom of choice nor the law of excluded middle, therefore the proof applies to the…

We present XTT, a version of Cartesian cubical type theory specialized for Bishop sets \`a la Coquand, in which every type enjoys a definitional version of the uniqueness of identity proofs. Using cubical notions, XTT reconstructs many of…

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

By using conformal symmetry we unify the standard model of particle physics with gravity in a consistent quantum field theory which describes all the fundamental particles and forces of nature.

We study the enumeration complexity of Unions of Conjunctive Queries(UCQs). We aim to identify the UCQs that are tractable in the sense that the answer tuples can be enumerated with a linear preprocessing phase and a constant delay between…

We propose a new cubical type theory, termed (self-deprecatingly) the naive cubical type theory, and study its semantics using the universe category framework, which is similar to Uemura's categories with representable morphisms. In…

The Connes Embedding Problem (CEP) asks whether every separable II_1 factor embeds into an ultrapower of the hyperfinite II_1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II_1 von…

We show that for various natural classes of groups and appropriately defined K- and L-theoretic functors, injectivity or bijectivity of the assembly map follows from the Isomorphism Conjecture being true for acyclic groups lying within that…

A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…