Computability of the ergodic decomposition

DOI10.1016/J.APAL.2012.11.005MaRDI QIDQ1944330zbMATH OpenOpenAlexFDO

Authors Mathieu Hoyrup

Publication date 5 April 2013

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2012.11.005

zbMATH Keywords

Birkhoff's ergodic theoremcomputable analysisergodic decompositionMartin-Löf randomness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Dynamical aspects of measure-preserving transformations (37A05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Randomness and the ergodic decomposition
• Randomness and non-ergodic systems
• Ergodic decomposition
• Uncomputably noisy ergodic limits
• Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей

Cited in

(10)

• Schnorr randomness for noncomputable measures
• New statistical models of nonergodic cognitive systems and their pathologies
• Computational ergodic theory
• Algorithmic randomness and Fourier analysis
• Universality, optimality, and randomness deficiency
• Ergodic decomposition
• Randomness and the ergodic decomposition
• Limit Theorems for the Maximal Random Sums
• Computable Measure Theory and Algorithmic Randomness
• scientific article; zbMATH DE number 6741918 (Why is no real title available?)

This page was built for publication: Computability of the ergodic decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944330)