Randomness and the ergodic decomposition
From MaRDI portal
Recommendations
Cites work
- Applications of Effective Probability Theory to Martin-Löf Randomness
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computable exchangeable sequences have computable de Finetti measures
- Ergodic theorems for individual random sequences
- Ergodic-Type Characterizations of Algorithmic Randomness
- scientific article; zbMATH DE number 5485513 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Lectures on Choquet's theorem
- Random elements in effective topological spaces with measure.
- The definition of random sequences
- Uniform test of algorithmic randomness over a general space
Cited in
(13)- Schnorr randomness for noncomputable measures
- Computability of the ergodic decomposition
- Algorithmical unsolvability of the ergodicity problem for locally interacting processes with continuous time
- Random decompositions of Eulerian statistics
- Effective notions of weak convergence of measures on the real line
- Genericity of weakly computable objects
- Randomness and non-ergodic systems
- Ergodic-Type Characterizations of Algorithmic Randomness
- scientific article; zbMATH DE number 599600 (Why is no real title available?)
- Computable Measure Theory and Algorithmic Randomness
- On the computability of a construction of Brownian motion
- Sporadic randomness, Maxwell's demon and the Poincaré recurrence times
- Ergodicity breakdown and scaling from single sequences
This page was built for publication: Randomness and the ergodic decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091447)