English
Related papers

Related papers: Van Lambalgen's theorem fails for some computable …

200 papers

As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of…

Computational Complexity · Computer Science 2015-07-01 Takakazu Mori , Yoshiki Tsujii , Mariko Yasugi

Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains…

Computational Complexity · Computer Science 2017-03-03 George Barmpalias , Andrew Lewis-Pye , Angsheng Li

We study the statistical properties of random numbers under the Martin-L\"of definition of randomness, proving that random numbers obey analogues of Strong Law of Large Numbers, the Law of the Iterated Logarithm, and that they are normal.…

Logic · Mathematics 2014-10-14 Matthew Pancia

We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets…

Logic in Computer Science · Computer Science 2010-06-03 Douglas Cenzer , Paul Brodhead

We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr random elements of the parameter space are computably consistent,…

Logic · Mathematics 2025-01-22 Simon M. Huttegger , Sean Walsh , Francesca Zaffora Blando

We study the compatibility of measurements on finite-dimensional compact convex state space in the framework of general probabilistic theory. Our main emphasis is on formulation of necessary and sufficient conditions for two-outcome…

Quantum Physics · Physics 2016-10-26 Martin Plávala

A quantum probability measure is a function on a sigma-algebra of subsets of a (locally compact and Hausdorff) sample space that satisfies the formal requirements for a measure, but whose values are positive operators acting on a complex…

Probability · Mathematics 2015-06-03 Douglas Farenick , Michael J. Kozdron

Let $\alpha\in (0, 1]$, $\beta\in [0, n)$ and $T_{\Omega,\beta}$ be a singular or fractional integral operator with homogeneous kernel $\Omega$. In this article, a CMO type space ${\rm CMO}_\alpha(\mathbb R^n)$ is introduced and studied. In…

Classical Analysis and ODEs · Mathematics 2018-02-23 Weichao Guo , Jianxun He , Huoxiong Wu , Dongyong Yang

We establish connections between the requirement of measurability of a probability space and the principle of complimentarity in quantum mechanics. It is shown that measurability of a probability space implies the dependence of results of…

Quantum Physics · Physics 2007-05-23 D. A. Slavnov

Bell's theorem is reformulated and proved in the pure mathematical terms of automata theory, avoiding any physical or ontological notions. It is stated that no pair of finite probabilistic sequential machines can reproduce in its output the…

Quantum Physics · Physics 2017-12-13 Michael Zirpel

We characterize pairs of orthogonal countable ordinals. Two ordinals $\alpha$ and $\beta$ are orthogonal if there are two linear orders $A$ and $B$ on the same set $V$ with order types $\alpha$ and $\beta$ respectively such that the only…

Combinatorics · Mathematics 2014-07-04 Claude Laflamme , Maurice Pouzet , Nobert Sauer , Imed Zaguia

This paper explores a novel definition of Schnorr randomness for noncomputable measures. We say $x$ is uniformly Schnorr $\mu$-random if $t(\mu,x)<\infty$ for all lower semicomputable functions $t(\mu,x)$ such that $\mu\mapsto\int…

Logic · Mathematics 2017-08-08 Jason Rute

We present the formalization of Doob's martingale convergence theorems in the mathlib library for the Lean theorem prover. These theorems give conditions under which (sub)martingales converge, almost everywhere or in $L^1$. In order to…

Logic in Computer Science · Computer Science 2022-12-13 Kexing Ying , Rémy Degenne

This letter studies measurement partitioning and equivalence in state estimation based on graph-theoretic principles. We show that a set of critical measurements (required to ensure LTI state-space observability) can be further partitioned…

Information Theory · Computer Science 2014-12-17 Mohammadreza Doostmohammadian , Usman A. Khan

The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory, due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More…

Quantum Physics · Physics 2020-09-30 Xin Wang , Mark M. Wilde

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…

Group Theory · Mathematics 2007-06-30 Ilya Kapovich , Paul Schupp

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Logic · Mathematics 2024-07-23 Philipp Hieronymi , Sven Manthe , Chris Schulz

Denote by $\mu_a$ the distribution of the random sum $(1-a) \sum_{j=0}^\infty \omega_j a^j$, where $P(\omega_j=0)=P(\omega_j=1)=1/2$ and all the choices are independent. For $0<a<1/2$, the measure $\mu_a$ is supported on $C_a$, the central…

Classical Analysis and ODEs · Mathematics 2013-03-21 Fedor Nazarov , Yuval Peres , Pablo Shmerkin

Predictions for measurement outcomes in physical theories are usually computed by combining two distinct notions: a state, describing the physical system, and an observable, describing the measurement which is performed. In quantum theory,…

Quantum Physics · Physics 2012-03-28 Markus P. Mueller , Cozmin Ududec

When testing a set of data for randomness according to a probability distribution that depends on a parameter, access to this parameter can be considered as a computational resource. We call a randomness test Hippocratic if it is not…

Logic · Mathematics 2014-08-14 Bjørn Kjos-Hanssen
‹ Prev 1 3 4 5 6 7 10 Next ›