1. B. Durand, A. Shen, N. Vereshchagin, Descriptive complexity of computable sequences, in: C. Meinel, S. Tison (Eds.), Proc. 16th Annu. Symp. on Theoretical Aspects of Computer Science, Trier, Germany, March 1999, Lecture Notes in Computer Science Vol. 1563, Springer, Berlin, pp. 153–162.
2. On the relation between descriptional complexity and algorithmic probability;Gács;Theoret. Comput. Sci.,1983
3. On Kolmogorov's complexity and information;Kamae;Osaka J. Math.,1973
4. An Introduction to Kolmogorov Complexity and its Applications;Li,1997
5. Lower limits on frequencies in computable sequences and relativized a priori probability;Muchnik;SIAM Theory Probab. Appl.,1987