Related papers: Uniformity, Universality, and Computability Theory
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the exploration of trade-offs between different measures of…
Let $E\subseteq F$ and $E'\subseteq F'$ be Borel equivalence relations on the standard Borel spaces $X$ and $Y$, respectively. The pair $(E,F)$ is simultaneously Borel reducible to the pair $(E',F')$ if there is a Borel function $f:X\to Y$…
We characterize conditions under which collections of distributions on $\{0,1\}^\mathbb{N}$ admit uniform estimation of their mean. Prior work from Vapnik and Chervonenkis (1971) has focused on uniform convergence using the empirical mean…
Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence relations on the computably enumerable (c.e.) sets. The first…
We investigate commutator operations on compatible uniformities of an algebra. We present a commutator operation for compatible uniformities of an algebra in a congruence-modular variety which extends the commutator on congruences, and…
We continue the research of the relation $\hspace{1mm}\widetilde{\mid}\hspace{1mm}$ on the set $\beta {\mathbb{N}}$ of ultrafilters on ${\mathbb{N}}$, defined as an extension of the divisibility relation. It is a quasiorder, so we see it as…
We study the quantum measurement problem in the context of an infinite, statistically uniform space, as could be generated by eternal inflation. It has recently been argued that when identical copies of a quantum measurement system exist,…
Building on work of Chen, we give a universal property of the Markov category BorelStoch of standard Borel spaces and Markov kernels between them. To do this, we introduce a new notion of *coinflip*, or unbiased binary choice, in a Markov…
Universal kernels, whose Reproducing Kernel Hilbert Space is dense in the space of continuous functions are of great practical and theoretical interest. In this paper, we introduce an explicit construction of universal kernels on compact…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…
This work introduces a novel framework of uniform realizability that unifies and generalizes various realizability interpretations of logic, particularly focussing on the treatment of atomic formulas and quantifiers. Traditional…
There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…
We generalize the concept of Borel resummability and renormalons to a quantum field theory with an arbitrary number of fields and couplings, starting from the known notion based on the running coupling constants. An approach to identify the…
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
Quantum theory has evolved from a set of provisional rules to an indispensable framework that underlies much of modern technology and infrastructure. Yet, after a century, Born's probability postulate remains at odds with the theory's…
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
We discuss here the significance of the generalization of the newtonian concept of force by that of a transformation of a certain Standard Borel Space of cardinality $\mathbf{c}$ of the continuum as the ``cause'' behind motions of material…
A remarkable property of Hermitian ensembles is their universal behavior, that is, once properly rescaled the eigenvalue statistics does not depend on particularities of the ensemble. Recently, normal matrix ensembles have attracted…