Randomness and the Ergodic Decomposition

DOI10.1007/978-3-642-21875-0_13zbMath1259.03057OpenAlexW50969306MaRDI QIDQ3091447

Mathieu Hoyrup

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00586736/file/paper.pdf

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)

Genericity of weakly computable objects ⋮ Schnorr randomness for noncomputable measures ⋮ On the computability of a construction of Brownian motion ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Effective notions of weak convergence of measures on the real line

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ergodic theorems for individual random sequences
• Random elements in effective topological spaces with measure.
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Uniform test of algorithmic randomness over a general space
• Computable Exchangeable Sequences Have Computable de Finetti Measures
• Ergodic-Type Characterizations of Algorithmic Randomness
• Applications of Effective Probability Theory to Martin-Löf Randomness
• The definition of random sequences
• Lectures on Choquet's theorem

This page was built for publication: Randomness and the Ergodic Decomposition