Computability of the ergodic decomposition

DOI10.1016/j.apal.2012.11.005zbMath1271.03063OpenAlexW2046269655MaRDI QIDQ1944330

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

ergodic decompositioncomputable analysisMartin-Löf randomnessBirkhoff's ergodic theorem

Mathematics Subject Classification ID

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

Related Items (5)

Schnorr randomness for noncomputable measures ⋮ New statistical models of nonergodic cognitive systems and their pathologies ⋮ Algorithmic randomness and Fourier analysis ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Universality, optimality, and randomness deficiency

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