1. On the length of programs for computing finite binary sequences: statistical considerations;Chaitin;J. ACM,1969
2. Descriptive complexity of computable sequences;Durand;Theor. Comput. Sci.,2001
3. Three approaches to the quantitative definition of information;Kolmogorov;Probl. Inf. Transm.,1965
4. An Introduction to Kolmogorov Complexity and Its Applications;Li,1997
5. A variant of Kolmogorov concept of complexity;Loveland;Inf. Control,1969