Computability and randomness: A. Nies2009Science Publications
Secundária
Algorithmic randomness and complexity: R. Downey and D. Hirschfeldt2010Springer-Verlag
Randomness and complexity, from Leibniz to Chaitin: C. Calude2007World Scientific Publishing
An introduction to Kolmogorov complexity and its applications (3 ed.): M. Li and P. Vitányi2008Springer Publishing Company
Lecture notes on descriptional complexity: P. Gacs2009Science Publications
Kolmogorov complexity and formula size lower bounds: T. Lee2006PhD thesis, ILLC, Universiteit van Amsterdam
Algorithmic information theory: P. Grünwald and P. Vitányi2008Handbook of the Philosophy of Science, volume 8, pages: 289-325, Elsevier Science Publishers
Analysis of sorting algorithms by Kolmogorov complexity (a survey): P. Vitányi2007Entropy, Search, Complexity, Bolyai Society Mathematical Studies, volume: 16, pages: 209-232, Springer-Verlag
Lower bounds using Kolmogorov complexity: S. Laplante2006Proceedings of CiE'06.
Instance complexity: P. Orponen, K. Ko, U. Schöning, and O. Watanabe1994Journal of ACM, volume: 41, issue: 1, pages: 95-121, ACM
Cryptographic security of individual instances: L. Antunes, S. Laplante, A. Pinto, L. Salvador2007Proceedings of ICITS
Goedel incompleteness revisited: G. Lafitte2008Proceedings of JAC'2008, pages: 74-89
Two decades of applied Kolmogorov complexity: In memoriam Andrei Nikolaevich Kolmogorov 1903 - 1987: M. Li and P. Vitányi2010Springer-Verlag