Randomness and the ergodic decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Randomness and the ergodic decomposition

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

Dates and versions

inria-00586736 , version 1 (18-04-2011)

Identifiers

  • HAL Id : inria-00586736 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More