Related papers: Van Lambalgen's theorem fails for some computable …
The Bell inequality constrains the outcomes of measurements on pairs of distant entangled particles. The Bell contradiction states that the Bell inequality is inconsistent with the calculated outcomes of these quantum experiments. This…
Every measurement determines a single value as its outcome, and yet quantum mechanics predicts it only probabilistically. The Kochen-Specker theorem and Bell's inequality are often considered to reject a realist view but favor a skeptical…
The hidden-variable question is whether or not various properties --- randomness or correlation, for example --- that are observed in the outcomes of an experiment can be explained via introduction of extra (hidden) variables which are…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is $\lambda$-calculus a reasonable machine? Is there a way to measure the computational…
We generalize Lyapunov's convexity theorem for classical (scalar-valued) measures to quantum (operator-valued) measures. In particular, we show that the range of a nonatomic quantum probability measure is a weak*-closed convex set of…
We investigate the consistency of conditional quantum probabilities. This is whether there is compatibility between the Kolmogorov-Bayes conditional probabilities and the Born rule. We show that they are not compatible in the sense that…
The Aharonov-Bergmann-Lebowitz rule assigns probabilities to quantum measurement results at time t on the condition that the system is prepared in a given way at t_1 < t and found in a given state at t_2 > t. The question whether the rule…
If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of Billingsley…
Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which…
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…
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 some former works of Azzam and Tolsa it was shown that $n$-rectifiability can be characterized in terms of a square function involving the David-Semmes $\beta_2$ coefficients. In the present paper we construct some counterexamples which…
The existence of incompatibility is one of the most fundamental features of quantum theory, and can be found at the core of many of the theory's distinguishing features, such as Bell inequality violations and the no-broadcasting theorem. A…
The Laplace approximation is a popular method for constructing a Gaussian approximation to the Bayesian posterior and thereby approximating the posterior mean and variance. But approximation quality is a concern. One might consider using…
Suppose that $\mathcal{C}$ is the space of all middle Cantor sets. We characterize all triples $(\alpha,~\beta,~\lambda)\in \mathcal{C}\times\mathcal{C}\times \mathbb{R}^*$ that satisfy $C_\alpha- \lambda C_\beta=[-\lambda,~1]. $ Also all…
It is known that the class $\mathcal{U}_{\beta}$, of generalized s-selfdecom-posable probability distributions, can be viewed as an image via random integral mapping $\mathcal{J}^{\beta}$ of the class $ID$ of all infinitely divisible…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine? Is there a way to measure the computational complexity…
Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…
According to the Bell theorem, local hidden variable theories cannot reproduce all the predictions of quantum mechanics. An important consequence is that under physically reasonable assumptions quantum mechanics predicts correlations that…
Let $\lambda$ be a probability measure on $\mathbb T^{n-1}$ where $n=2$ or 3. Suppose $\lambda$ is invariant, ergodic and has positive entropy with respect to the linear transformation defined by a hyperbolic matrix. We get a measure $\mu $…