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.
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00746473
Contributeur : Mathieu Hoyrup <>
Soumis le : lundi 29 octobre 2012 - 10:27:09
Dernière modification le : jeudi 11 janvier 2018 - 06:21:25
Document(s) archivé(s) le : mercredi 30 janvier 2013 - 03:37:45

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Mathieu Hoyrup. Computability of the ergodic decomposition. Annals of Pure and Applied Logic, Elsevier Masson, 2013, 164 (5), pp.542-549. 〈http://www.sciencedirect.com/science/article/pii/S0168007212001868〉. 〈10.1016/j.apal.2012.11.005〉. 〈hal-00746473〉

Partager

Métriques

Consultations de la notice

241

Téléchargements de fichiers

186