P. Erdös and L. Lovász, Problems and results of 3-chromatic hypergraphs and some related questions, vol.II, pp.609-627

M. Hoyrup and C. Rojas, Applications of Effective Probability Theory to Martin-Löf Randomness, Lectures Notes in Computer Science, vol.5555, pp.549-561, 2009.

J. Miller, Two notes on subshifts

R. A. Moser and G. Tardos, A constructive proof of the general Lovász Local Lemma, Journal of the ACM, vol.57, issue.2, 2010.

A. Rumyantsev and F. Substrings, Kolmogorov Complexity and Almost Periodic Sequences, STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, vol.3884, pp.396-407, 2006.

A. Rumyantsev and K. Complexity, Lovász Local Lemma and Critical Exponents, Lecture Notes in Computer Science, vol.4649, pp.349-355, 2007.

A. Rumyantsev, Everywhere complex sequences and probabilistic method
URL : https://hal.archives-ouvertes.fr/hal-00573595

A. Rumyantsev, Infinite computable version of Lovasz Local Lemma

A. K. Zvonkin and L. A. Levin, The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Uspekhi Matematicheskikh Nauk, vol.25, issue.6, pp.85-127, 1970.