Computable randomness and betting for computable probability spaces
From MaRDI portal
Publication:2827949
DOI10.1002/malq.201200089zbMath1364.03064arXiv1203.5535OpenAlexW2963803153MaRDI QIDQ2827949
Publication date: 24 October 2016
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.5535
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of probability theory (60A99) Algorithmic randomness and dimension (03D32)
Related Items
When does randomness come from randomness?, Randomness and Differentiability of Convex Functions, Strong reductions in effective randomness, Algorithmic randomness, reverse mathematics, and the dominated convergence theorem, A universal pair of 1/2-betting strategies, Computable Measure Theory and Algorithmic Randomness, Effective notions of weak convergence of measures on the real line
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomness on computable probability spaces -- a dynamical point of view
- Computable de Finetti measures
- Comparing notions of randomness
- Effective dimension of points visited by Brownian motion
- Constructive equivalence relations on computable probability measures
- Mathematical metaphysics of randomness
- Ergodic theorems for individual random sequences
- Random elements in effective topological spaces with measure.
- Effective metric spaces and representations of the reals.
- Strong reductions in effective randomness
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Why computational complexity requires stricter martingales
- Some results on effective randomness
- Algorithmic tests and randomness with respect to a class of measures
- Uniform test of algorithmic randomness over a general space
- Kolmogorov-Loveland randomness and stochasticity
- $K$-triviality in computable metric spaces
- Schnorr randomness and the Lebesgue differentiation theorem
- Separations of non-monotonic randomness notions
- Truth-table Schnorr randomness and truth-table reducible randomness
- On Schnorr and computable randomness, martingales, and machines
- Algorithmic Randomness and Complexity
- Randomness and differentiability
- Exact Expressions for Some Randomness Tests
- Probability with Martingales
- General random sequences and learnable sequences
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Uniform distribution and algorithmic randomness
- Admissible representations for probability measures
- Degrees of unsolvability of continuous functions
- Computability and Randomness
- Algorithmic randomness over general spaces
- Algorithmic Randomness of Closed Sets
- A unified approach to the definition of random sequences
