Related papers: Measures and their random reals
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…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…
The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We start with computable measures on Cantor space (and Martin-Lof…
Quantum measurements can produce randomness arising from the uncertainty principle. When measuring a state with von Neumann measurements, the intrinsic randomness can be quantified by the quantum coherence of the state on the measurement…
We study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the "dissipation"…
Quantum measurements are noncontextual, with outcomes independent of which other commuting observables are measured at the same time, when consistently analyzed using principles of Hilbert space quantum mechanics rather than classical…
In the first part of this two-part article, we have introduced and analyzed a multidimensional model, called the 'general tension-reduction' (GTR) model, able to describe general quantum-like measurements with an arbitrary number of…
We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure $\mu$ on the space of infinite bit sequences is ML absolutely continuous if the non-ML-random bit sequences form a null set with…
We show that every homeomorphism between closed measure zero subsets extends to a measure preserving auto-homeomorphism, whenever the Cantor set is endowed with a suitable probability measure. This is valid both for the standard product…
Measurements of quantum systems can be used to generate classical data that is truly unpredictable for every observer. However, this true randomness needs to be discriminated from randomness due to ignorance or lack of control of the…
This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…
Measurements are shown to be processes designed to return figures: they are effective. This effectivity allows for a formalization as Turing machines, which can be described employing computation theory. Inspired in the halting problem we…
A semi-measure is a generalization of a probability measure obtained by relaxing the additivity requirement to super-additivity. We introduce and study several randomness notions for left-c.e. semi-measures, a natural class of effectively…
Randomized measurements are useful for analyzing quantum systems especially when quantum control is not fully perfect. However, their practical realization typically requires multiple rotations in the complex space due to the adoption of…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…
We show from a categorical point of view that probability measures on certain measurable or topological spaces arise canonically as the extension of probability distributions on countable sets. We do this by constructing probability monads…
It is well-established that quantum probability does not follow classical Kolmogorov probability calculus. Various approaches have been developed to loosen the axioms, of which the use of signed measures is the most successful (e.g. the…
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating that "a real is c.e. and random iff it is the halting…
Quantum physics exhibits an intrinsic and private form of randomness with no classical counterpart. Any setup for quantum randomness generation involves measurements acting on quantum states. In this work, we consider the following…