Randomness and the Ergodic Decomposition
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.
Unable to display preview. Download preview PDF.
- 4.Gács, P.: Lecture notes on descriptional complexity and randomness. Tech. rep., Boston University (2008)Google Scholar
- 10.Nandakumar, S.: An effective ergodic theorem and some applications. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 39–44. ACM, New York (2008)Google Scholar