Randomness and the Ergodic Decomposition

  • Mathieu Hoyrup
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6735)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bienvenu, L., Day, A., Mezhirov, I., Shen, A.: Ergodic-type characterizations of algorithmic randomness. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol. 6158, pp. 49–58. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Freer, C.E., Roy, D.M.: Computable exchangeable sequences have computable de finetti measures. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 218–231. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Gács, P.: Uniform test of algorithmic randomness over a general space. Theoretical Computer Science 341, 91–137 (2005)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Gács, P.: Lecture notes on descriptional complexity and randomness. Tech. rep., Boston University (2008)Google Scholar
  5. 5.
    Hertling, P., Weihrauch, K.: Random elements in effective topological spaces with measure. Information and Computation 181(1), 32–56 (2003)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Hoyrup, M., Rojas, C.: Applications of effective probability theory to martin-löf randomness. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 549–561. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Hoyrup, M., Rojas, C.: Computability of probability measures and Martin-Löf randomness over metric spaces. Inf. Comput. 207(7), 830–847 (2009)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Levin, L.A.: On the notion of a random sequence. Soviet Mathematics Doklady 14, 1413–1416 (1973)MATHGoogle Scholar
  9. 9.
    Martin-Löf, P.: The definition of random sequences. Information and Control 9(6), 602–619 (1966)MathSciNetCrossRefMATHGoogle Scholar
  10. 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
  11. 11.
    Phelps, R.R.: Lectures on Choquet’s Theorem, 2nd edn. Springer, Berlin (2001)CrossRefMATHGoogle Scholar
  12. 12.
    V’yugin, V.V.: Ergodic theorems for individual random sequences. Theoretical Computer Science 207(4), 343–361 (1998)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mathieu Hoyrup
    • 1
  1. 1.LORIA, INRIA Nancy-Grand EstVandœuvre-lès-NancyFrance

Personalised recommendations