Skip to Main content Skip to Navigation
Journal articles

Computability of 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 study of ergodic theorems from the viewpoint of computable analysis is a rich field of investigation. Interactions between algorithmic randomness, computability theory and ergodic theory have recently been examined by several authors. It has been observed that ergodic measures have better computability properties than non-ergodic ones. In a previous paper we studied the extent to which non-ergodic measures inherit the computability properties of ergodic ones, and introduced the notion of an effectively decomposable measure. We asked the following question: if the ergodic decomposition of a stationary measure is finite, is this decomposition effective? In this paper we answer the question in the negative.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Mathieu Hoyrup <>
Submitted on : Monday, October 29, 2012 - 10:27:09 AM
Last modification on : Thursday, July 22, 2021 - 3:10:02 PM
Long-term archiving on: : Wednesday, January 30, 2013 - 3:37:45 AM


Files produced by the author(s)




Mathieu Hoyrup. Computability of the ergodic decomposition. Annals of Pure and Applied Logic, Elsevier Masson, 2013, 164 (5), pp.542-549. ⟨10.1016/j.apal.2012.11.005⟩. ⟨hal-00746473⟩



Record views


Files downloads