Construction of sequences of zeros and ones with complex finite sequences / A. Yu. Rumyantsev. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2010. ? 1. P. 41-45 [Moscow Univ. Math. Bulletin. Vol. 65, N 1, 2010. P. 39-43].

We construct infinite sequences of zeros and ones under some restrictions (not to contain subwords of some definite type or definite bits at definite positions, etc.). This paper concerns probabilistic methods of constructing such sequences with application of Lovász lemma and their reformulation in terms of the Kolmogorov complexity and Martin-L&ounl;f randomness.

Key words: Kolmogorov complexity, prefix complexity, sequence, subsequence, combinatorics, probability.