Computability of the ergodic decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Pure and Applied Logic Year : 2013

Computability of the ergodic decomposition


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.
Fichier principal
Vignette du fichier
paper.pdf (162.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00746473 , version 1 (29-10-2012)



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



Gmail Facebook X LinkedIn More