Related papers: Schnorr randomness for noncomputable measures
Let X be a real or complex Hilbert space of finite but large dimension d, let S(X) denote the unit sphere of X, and let u denote the normalized uniform measure on S(X). For a finite subset B of S(X), we may test whether it is approximately…
This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…
We consider the cubic nonlinear fourth-order Schr\"odinger equation \[ i\partial_t u - \Delta^2 u + \mu \Delta u = \pm |u|^2 u, \quad \mu \geq 0 \] on $\mathbb{R}^N, N \geq 5$ with random initial data. We prove almost sure local…
Uniform measures are defined as the functionals on the space of bounded uniformly continuous functions that are continuous on bounded uniformly equicontinuous sets. If every cardinal has measure zero then every countably additive measure is…
We present a way of introducing joint distibution function and its marginal distribution functions for non-compatible observables. Each such marginal distribution function has the property of commutativity. Models based on this approach can…
We prove that the Hilbert space description of all joint von Neumann measurements on a quantum state can be reproduced in terms of a single measure space ({\Omega}, F, {\mu}) with a normalized real-valued measure {\mu}, that is, in terms of…
We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…
We consider the question of computing invariant measures from an abstract point of view. We work in a general framework (computable metric spaces, computable measures and functions) where this problem can be posed precisely. We consider…
In a prequential approach to algorithmic randomness, probabilities for the next outcome can be forecast `on the fly' without the need for fully specifying a probability measure on all possible sequences of outcomes, as is the case in the…
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…
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…
This paper is devoted to the averaged controllability of the random Schr\"odinger equation, with diffusivity as a random variable drawn from a general probability distribution. First, we show that the solutions to these random Schr\"odinger…
The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…
Given a c\`adl\`ag process $X$ on a filtered measurable space, we construct a version of its semimartingale characteristics which is measurable with respect to the underlying probability law. More precisely, let $\mathfrak{P}_{sem}$ be the…
Call a noncommutative rational function $r$ regular if it has no singularities, i.e., $r(X)$ is defined for all tuples of self-adjoint matrices $X$. In this article regular noncommutative rational functions $r$ are characterized via the…
We study randomness beyond $\Pi^1_1$-randomness and its Martin-L\"of type variant, introduced in \cite{MR2340241} and further studied in \cite{Continuous-higher-randomness}. The class given by the infinite time Turing machines (\ITTM s),…
In this paper it is shown that an Ahlfors-David $n$-dimensional measure $\mu$ on $\mathbb{R}^d$ is uniformly $n$-rectifiable if and only if for any ball $B(x_0,R)$ centered at $\operatorname{supp}(\mu)$, $$ \int_0^R \int_{x\in B(x_0,R)}…
We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…
In a recent paper [1], it has been claimed that the outcomes of a quantum coin toss which is idealized as an infinite binary sequence is 1-random. We also defend the correctness of this claim and assert that the outcomes of quantum…
Projective (Von Neumann) Measurement of an operator (i.e. a dynamical variable) selected from a prescribed set of operators is termed unrecorded measurement (URM) when both the selected operator and the measurement outcome are unknown, i.e.…