English
Related papers

Related papers: Uniformity, Universality, and Computability Theory

200 papers

Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

Logic · Mathematics 2025-05-13 Michael Wolman

Correlation clustering is a ubiquitous paradigm in unsupervised machine learning where addressing unfairness is a major challenge. Motivated by this, we study Fair Correlation Clustering where the data points may belong to different…

Machine Learning · Computer Science 2022-06-13 Sara Ahmadian , Maryam Negahbani

In this paper, the notion of simultaneous universality is introduced, concerning operators having orbits that simultaneously approximate any given vector. This notion is related to the well known concepts of universality and disjoint…

Functional Analysis · Mathematics 2017-01-26 Luis Bernal-González , Andreas Jung

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

Computational Complexity · Computer Science 2015-05-07 Cristian S. Calude , Damien Desfontaines

We regard Forcing Notions P adding real numbers and the algebras of P-measurable sets. As for Cohen- and Random-Forcing we can show that each analytic set is P-measurable using Solovay's Unfolding Trick for infinite games. To show this we…

Logic · Mathematics 2016-09-06 Benedikt Loewe

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

Classical Analysis and ODEs · Mathematics 2011-10-26 Armen Bagdasaryan

Motivated by statistical practice, category theory terminology is used to introduce Borel data structures and study exchangeability in an abstract framework. A generalization of de Finetti's theorem is shown and natural transformations are…

Probability · Mathematics 2022-08-24 Julian Gerstenberg

Incompatibility of quantum devices is one of the cornerstones of quantum theory, and the incompatibility of quantum measurements and channels has been linked to quantum advantage in certain information theoretic tasks. In this work, we…

Quantum Physics · Physics 2023-03-28 Arindam Mitra , Máté Farkas

A growing number of empirical models exhibit set-valued predictions. This paper develops a tractable inference method with finite-sample validity for such models. The proposed procedure uses a robust version of the universal inference…

Econometrics · Economics 2025-01-31 Hiroaki Kaido , Yi Zhang

We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…

Rings and Algebras · Mathematics 2023-12-12 Fred Greensite

We answer several questions about the computable Friedman-Stanley jump on equivalence relations. This jump, introduced by Clemens, Coskey, and Krakoff, deepens the natural connection between the study of computable reduction and its Borel…

Logic · Mathematics 2022-06-24 Uri Andrews , Luca San Mauro

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Logic · Mathematics 2016-11-04 Mohammad Assem

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

Logic · Mathematics 2025-11-11 Antonio Nakid Cordero

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

Logic · Mathematics 2010-12-07 Su Gao , Peter Gerdes

We give a survey of various recent developments in orbit equivalence and measured group theory. This subject aims at studying infinite countable groups through their measure preserving actions.

Group Theory · Mathematics 2010-09-02 Damien Gaboriau

Quantum-mechanical interpretation-related implications of the theory of unitary premeasurement [1] on complete measurement (objectification or collapse included) are investigated in the present article with a view to give an affirmative…

Quantum Physics · Physics 2016-11-06 Fedor Herbut

For any pair of bounded observables $A$ and $B$ with pure point spectra, we construct an associated "joint observable" which gives rise to a notion of a joint (projective) measurement of $A$ and $B$, and which conforms to the intuition that…

Quantum Physics · Physics 2015-06-22 Richard DeJonghe , Kimberly Frey , Tom Imbo

We introduce a new example of unital commutative $n$-dimensional group algebra $\mathbb{R}_n$ for $n \geq 2$. The algebra $\mathbb{R}_n$ and the complex numbers $\mathbb{C}$ are astonishingly alike. The zero divisor set of the algebra has…

Functional Analysis · Mathematics 2021-09-07 Xingde Dai , Wei Huang