Computable randomness and betting for computable probability spaces
From MaRDI portal
Publication:2827949
Abstract: Unlike Martin-L"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and further, provides a general method for abstracting "bit-wise" definitions of randomness from Cantor space to arbitrary computable probability spaces. This same method is also applied to give machine characterizations of computable and Schnorr randomness for computable probability spaces, extending the previously known results. The paper contains a new type of randomness---endomorphism randomness---which the author hopes will shed light on the open question of whether Kolmogorov-Loveland randomness is equivalent to Martin-L"of randomness. The last section contains ideas for future research.
Recommendations
- Randomness on computable probability spaces -- a dynamical point of view
- Randomness on computable probability spaces -- a dynamical point of view
- Computable randomness is about more than probabilities
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Probabilistic Algorithmic Randomness
Cites work
- scientific article; zbMATH DE number 5606368 (Why is no real title available?)
- scientific article; zbMATH DE number 5309069 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 3532844 (Why is no real title available?)
- scientific article; zbMATH DE number 1543069 (Why is no real title available?)
- scientific article; zbMATH DE number 1834650 (Why is no real title available?)
- A unified approach to the definition of random sequences
- Admissible representations for probability measures
- Algorithmic Randomness of Closed Sets
- Algorithmic randomness and complexity.
- Algorithmic randomness over general spaces
- Algorithmic tests and randomness with respect to a class of measures
- Comparing notions of randomness
- Computability and Randomness
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computable de Finetti measures
- Constructive equivalence relations on computable probability measures
- Degrees of unsolvability of continuous functions
- Effective dimension of points visited by Brownian motion
- Effective metric spaces and representations of the reals.
- Ergodic theorems for individual random sequences
- Exact Expressions for Some Randomness Tests
- General random sequences and learnable sequences
- Kolmogorov-Loveland randomness and stochasticity
- Mathematical metaphysics of randomness
- On Schnorr and computable randomness, martingales, and machines
- Probability with Martingales
- Random elements in effective topological spaces with measure.
- Randomness and differentiability
- Randomness on computable probability spaces -- a dynamical point of view
- Schnorr randomness and the Lebesgue differentiation theorem
- Separations of non-monotonic randomness notions
- Some results on effective randomness
- Strong reductions in effective randomness
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Truth-table Schnorr randomness and truth-table reducible randomness
- Uniform distribution and algorithmic randomness
- Uniform test of algorithmic randomness over a general space
- Why computational complexity requires stricter martingales
- \(K\)-triviality in computable metric spaces
Cited in
(18)- Process and truth-table characterisations of randomness
- Computability on random events and variables in a computable probability space
- Integer valued betting strategies and Turing degrees
- Effective notions of weak convergence of measures on the real line
- Constructive Equivalence Relations on Computable Probability Measures
- Notions of Probabilistic Computability on Represented Spaces
- A computational definition of financial randomness
- When does randomness come from randomness?
- Randomness on computable probability spaces -- a dynamical point of view
- Randomness and differentiability of convex functions
- Computability of probability measures and Martin-Löf randomness over metric spaces
- scientific article; zbMATH DE number 5309069 (Why is no real title available?)
- Computable randomness is about more than probabilities
- Computable Measure Theory and Algorithmic Randomness
- Strong reductions in effective randomness
- A universal pair of 1/2-betting strategies
- Randomness on computable probability spaces -- a dynamical point of view
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
This page was built for publication: Computable randomness and betting for computable probability spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827949)
