Related papers: Van Lambalgen's theorem fails for some computable …
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
Let $L=\Delta^{\alpha/2}+ b\cdot\nabla$ with $\alpha\in(1,2)$. We prove the Martin representation and the Relative Fatou Theorem for non-negative singular $L$-harmonic functions on ${\mathcal C}^{1,1}$ bounded open sets.
Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.
It is well-known in quantum information theory that a positive operator valued measure (POVM) is the most general kind of quantum measurement. Mathematically, a quantum probability is a normalised POVM, namely a function on certain subsets…
We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…
Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to computable \emph{trivial} measures, where a measure $\mu$ on…
We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…
Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to image distribution if and only…
We provide a composite version of Ville's theorem that an event has zero measure if and only if there exists a nonnegative martingale which explodes to infinity when that event occurs. This is a classic result connecting measure-theoretic…
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…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
A notion of admissible probability measures $\mu$ on a locally compact Abelian group (LCA-group) $G$ with connected dual group $\hat G=\R^d\times \T^n$ is defined. To such a measure $\mu$, a closed semigroup $\Lambda(\mu)\subseteq…
A real number $x$ is normal with respect to an integer base $b \geq 2$ if its digit expansion in this base is ``equitable'', in the sense that for $k \geq 1$, every ordered sequence of $k$ digits from $\{0, 1, \ldots, b-1\}$ occurs in the…
In quantum physics the term `contextual' can be used in more than one way. One usage, here called `Bell contextual' since the idea goes back to Bell, is that if $A$, $B$ and $C$ are three quantum observables, with $A$ compatible (i.e.,…
We develop a synthesis of Turing's paradigm of computation and von Neumann's quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing…
We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models…
A simple classical, deterministic, local situation violating the Bell inequality is described. The detectors used in the experiment are ideal and the observers who decide which pair of measuring devices to choose for a given pair of…
We study algorithmically random closed subsets of $2^\omega$, algorithmically random continuous functions from $2^\omega$ to $2^\omega$, and algorithmically random Borel probability measures on $2^\omega$, especially the interplay between…
Mutual information I in infinite sequences (and in their finite prefixes) is essential in theoretical analysis of many situations. Yet its right definition has been elusive for a long time. I address it by generalizing Kolmogorov Complexity…
A classical theorem of Lusin states that all analytic sets are Lebesgue-measurable. In this article we established the reverse mathematical strength of Lusin's theorem, which depends on how precisely it is formalized. By doing so, we answer…