Related papers: Van Lambalgen's Theorem for uniformly relative Sch…

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

Let $A$ be a complex, commutative unital Banach algebra. We introduce two notions of exponential reducibility of Banach algebra tuples and present an analogue to the Corach-Su\'arez result on the connection between reducibility in $A$ and…

In this article we reduce the geometric stability conjecture for the scalar torus rigidity theorem to the conformal case via the Yamabe problem. Then we are able to prove the case where a sequence of Riemannian manifolds is conformal to a…

The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability…

We propose a novel modular debiasing technique applicable to any discrete random source, addressing the fundamental challenge of reliably extracting high-quality randomness from inherently imperfect physical processes. The method involves…

We show that part I of uniform Martin's conjecture follows from a local phenomenon, namely that if a non-constant Turing invariant function goes from the Turing degree $\boldsymbol x$ to the Turing degree $\boldsymbol y$, then $\boldsymbol…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…

Firstly, we propose our conjectured Reverse-log-Brunn-Minkowski inequality (RLBM). Secondly, we show that the (RLBM) conjecture is equivalent to the log-Brunn-Minkowski (LBM) conjecture proposed by B\"or\"oczky-Lutwak-Yang-Zhang. We name…

There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…

Debbah and Ryan have recently proved a result about the limit empirical singular distribution of the sum of two rectangular random matrices whose dimensions tend to infinity. In this paper, we reformulate it in terms of the rectangular free…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.

A result of Shen says that if $F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$ is an almost-everywhere computable, measure-preserving transformation, and $y\in2^{\mathbb{N}}$ is Martin-L\"of random, then there is a Martin-L\"of random…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…

In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Martin-Loef randomness and computable randomness. The latter…

We give a one-sentence proof of McLaughlin and Rundell's inverse uniqueness theorem.

Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable…

We compare two examples of random dense countable sets, `Brownian local minima' and `unordered uniform infinite sample'. They appear to be identically distributed. A framework for such notions is proposed. In addition, random elements of…