R. Beigel, H. M. Buhrman, P. Feijer, L. Fortnow, P. Grabowski et al., Enumerations of the Kolmogorov function, this Journal, vol.7, issue.501, pp.501-528, 2006.

R. G. Downey and D. R. Hirschfeldt, Algorithmic randomness and complexity, 2010.

P. Gács, On the symmetry of algorithmic information, Lecture notes on descriptional complexity and randomness, vol.15, pp.1477-1480, 1974.

E. Kalinina, Some applications of the method of games in Kolmogorov complexity, Master's thesis, 2011.

A. N. Kolmogorov, Three approaches to the quantitative definition of information, Problemy Peredachi Informatsii, vol.1, issue.1, pp.3-11, 1965.

L. A. Levin, The various measures of the complexity of finite objects (an axiomatic description), Soviet Mathematics Doklady, vol.17, issue.2, pp.522-526, 1976.

M. Li and P. M. Vitányi, An introduction to Kolmogorov complexity and its applications, 2008.

J. S. Miller, Contrasting plain and prefix-free Kolmogorov complexity, unpublished, 2006.

A. Muchnik, On the basic structures of the descriptive theory of algorithms, vol.32, pp.671-674, 1985.

A. A. Muchnik, I. Mezhirov, A. Shen, and N. Vereshchagin, Game interpretation of Kolmogorov complexity, unpublished, 2010.

A. Shen, Algorithmic information theory and Kolmogorov complexity, 2000.

R. M. Solovay, Draft of a paper (or series of papers) on Chaitin's work., 215 pp., unpublished, 1975.

N. Vereshchagin, Kolmogorov complexity and games, Bulletin of the European Association for Theoretical Computer Science, vol.94, pp.51-83, 2008.

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, Russian Mathematical Surveys, vol.25, issue.6, pp.83-124, 1970.

U. Loria, -. De-lorraine, V. Botanique, F. Url, W. Bcomp et al.,

. Lirmm-cnrs-&-university and . Of-montpellier, , p.161

A. Rue, F. Leave, and M. Iitp-ras,