Related papers: On the Uniform Computational Content of Computabil…
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…
We study the connections between three seemingly different combinatorial structures - "uniform" brackets in statistics and probability theory, "containers" in online and distributed learning theory, and "combinatorial Macbeath regions", or…
Recently, versions of neural networks with infinite-dimensional affine operators inside the computational units (``neural operator'' networks) have been applied to learn solutions to differential equations. To enable practical computations,…
We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
In the 1980s, category theorists introduced the Lawvere-Tierney $(\leq_{\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In…
An important consequence of the Hahn-Banach Theorem says that on any locally convex Hausdorff topological space $X$, there are sufficiently many continuous linear functionals to separate points of $X$. In the paper, we establish a `local'…
We study presentations of $C^*(X)$ that are evaluative over a presentation of $X$ in that $(f,p) \mapsto f(p)$ is computable. We prove existence-uniqueness theorems for such presentations. We use our methods to prove an effective…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
In the 1970s Alain Connes identified the appropriate notion of amenabilty for von Neumann algebras, and used it to obtain a deep internal finite dimensional approximation structure for these algebras. This structure is exactly what is…
A Martin-L\"of test $\mathcal U$ is universal if it captures all non-Martin-L\"of random sequences, and it is optimal if for every ML-test $\mathcal V$ there is a $c \in \omega$ such that $\forall n(\mathcal{V}_{n+c} \subseteq…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
Computability logic (CoL) provides a semantic foundation in which formulas represent interactive computational problems and validity corresponds to uniform algorithmic solvability. Building on this foundation, clarithmetics -- CoL-based…
We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…