Related papers: On the close interaction between algorithmic rando…
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…
Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
Based on the theory of quantum mechanics, intrinsic randomness in measurement distinguishes quantum effects from classical ones. From the perspective of states, this quantum feature can be summarized as coherence or superposition in a…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…
Product measures of dimension $n$ are known to be concentrated in Hamming distance: for any set $S$ in the product space of probability $\epsilon$, a random point in the space, with probability $1-\delta$, has a neighbor in $S$ that is…
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not…
Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…
This paper presents arguments purporting to show that von Neumann's description of the measurement process in quantum mechanics has a modern day version in the decoherence approach. We claim that this approach and the de Broglie-Bohm theory…
Compressed sensing is the art of reconstructing structured $n$-dimensional vectors from substantially fewer measurements than naively anticipated. A plethora of analytic reconstruction guarantees support this credo. The strongest among them…
This tutorial gives an overview of some of the basic techniques of measure theory. It includes a study of Borel sets and their generators for Polish and for analytic spaces, the weak topology on the space of all finite positive measures…
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…
We study the question, ``For which reals $x$ does there exist a measure $\mu$ such that $x$ is random relative to $\mu$?'' We show that for every nonrecursive $x$, there is a measure which makes $x$ random without concentrating on $x$. We…
The notion of expansivity and its generalizations (measure expansive, measure positively expansive, continuum-wise expansive, countably-expansive) are well known for deterministic systems and can be a useful property for studying…
The 2013 logic blog has focussed on the following: 1. Higher randomness. Among others, the Borel complexity of $\Pi^1_1$ randomness and higher weak 2 randomness is determined. 2. Reverse mathematics and its relationship to randomness. For…
Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are corrupted by noise. These algorithms are useful, for…
One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…
Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle. Kobayashi compressibility has remained a relatively obscure notion, with the…
We introduce the concept of a "classical observable" as an operator with vanishingly small quantum fluctuations on a set of density matrices. It is shown how to construct them for a time evolved pure state. The study of classical…