Randomness and Non-ergodic Systems

zbMath1335.03039arXiv1206.2682MaRDI QIDQ2801859

Johanna N. Y. Franklin, Henry Towsner

Publication date: 22 April 2016

Full work available at URL: https://arxiv.org/abs/1206.2682

zbMATH Keywords

dynamical systemergodic theoremMartin-Löf randomnessalgorithmic randomnessupcrossing

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25) Algorithmic randomness and dimension (03D32)

Related Items (10)

Randomness extraction in computability theory ⋮ On stability of probability laws with respect to small violations of algorithmic randomness ⋮ UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ Realizing semicomputable simplices by computable dynamical systems ⋮ Ergodic theorems and converses for PSPACE functions ⋮ Algorithmic randomness and Fourier analysis ⋮ Classical, quantum and biological randomness as relative unpredictability ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ A Church-Turing thesis for randomness?

This page was built for publication: Randomness and Non-ergodic Systems