G. ;. Barmpalias, P. ;. Broadhead, . Cenzer, ;. Douglas, S. ;. Dashti et al., Algorithmic randomness and closed sets, Journal of Logic and Computation, vol.17, issue.6, pp.1041-1062, 2007.

L. ;. Bienvenu, . Gács, ;. Péter, . Hoyrup, ;. Mathieu et al., Algorithmic tests and randomness with respect to a class of measures, Proceedings of the Steklov Institute of Mathematics, vol.274, pp.34-89, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644785

L. ;. Bienvenu, A. Romashchenko, and A. Shen, Sparse sets, Journées Automates Cellulaires, pp.18-28, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00274010

D. Diamondstone, . Kjos-hanssen, M. Bjørn, G. Randomness, and . Processes, Annals of Pure and Applied Logic, vol.163, issue.5, pp.519-529, 2012.

M. Hoyrup and C. Rojas, An Application of Martin-Löf Randomness to Effective Probability Theory, Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, pp.260-269, 2009.

P. Martin-löf, The definition of random sequences, Information and Control (now Information and Computation, vol.9, pp.602-619, 1966.

J. S. Miller, J. Rute, and E. Randomness,

A. Rumyantsev, Infinite computable version of Lovasz Local Lemma, preprint, 2010.

A. Rumyantsev and A. Shen, Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma, Fundamenta Informaticae, vol.32, issue.1, pp.1-14, 2014.

N. ;. Vereshchagin, V. Uspensky, A. Shen, and K. Complexity,

H. Takahashi, Algorithmic randomness and monotone complexity on product space, Information and Computation, vol.209, issue.2, pp.183-197, 2011.

V. Vovk and V. Vyugin, On the empirical validity of the Bayesian method, Journal of the Royal Statistical Society. Series B (Methodological), vol.55, issue.1, pp.253-266, 1993.