Skip to Main content Skip to Navigation
New interface
Conference papers

Randomness and the ergodic decomposition

Mathieu Hoyrup 1 
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : The interaction between algorithmic randomness and ergodic theory is a rich field of investigation. In this paper we study the particular case of the ergodic decomposition. We give several positive partial answers, leaving the general problem open. We shortly illustrate how the effectivity of the ergodic decomposition allows one to easily extend results from the ergodic case to the non-ergodic one (namely Poincaré recurrence theorem). We also show that in some cases the ergodic measures can be computed from the typical realizations of the process.
Complete list of metadata
Contributor : Mathieu Hoyrup Connect in order to contact the contributor
Submitted on : Monday, April 18, 2011 - 12:10:29 PM
Last modification on : Saturday, June 25, 2022 - 7:43:30 PM
Long-term archiving on: : Thursday, November 8, 2012 - 4:41:13 PM


Files produced by the author(s)


  • HAL Id : inria-00586736, version 1


Mathieu Hoyrup. Randomness and the ergodic decomposition. Computability in Europe, Jun 2011, Sofia, Bulgaria. pp.122-131. ⟨inria-00586736⟩



Record views


Files downloads