Bibliografia

Principal

  • Computability and randomness: A. Nies 2009 Science Publications

Secundária

  • Algorithmic randomness and complexity: R. Downey and D. Hirschfeldt 2010 Springer-Verlag
  • Randomness and complexity, from Leibniz to Chaitin: C. Calude 2007 World Scientific Publishing
  • An introduction to Kolmogorov complexity and its applications (3 ed.): M. Li and P. Vitányi 2008 Springer Publishing Company
  • Lecture notes on descriptional complexity: P. Gacs 2009 Science Publications
  • Kolmogorov complexity and formula size lower bounds: T. Lee 2006 PhD thesis, ILLC, Universiteit van Amsterdam
  • Algorithmic information theory: P. Grünwald and P. Vitányi 2008 Handbook of the Philosophy of Science, volume 8,  pages: 289-325,  Elsevier Science Publishers
  • Analysis of sorting algorithms by Kolmogorov complexity (a survey): P. Vitányi 2007 Entropy, Search, Complexity, Bolyai Society Mathematical Studies, volume: 16, pages: 209-232, Springer-Verlag
  • Lower bounds using Kolmogorov complexity: S. Laplante 2006 Proceedings of CiE'06.
  • Instance complexity: P. Orponen, K. Ko, U. Schöning, and O. Watanabe 1994 Journal of ACM, volume: 41, issue: 1,  pages: 95-121, ACM
  • Cryptographic security of individual instances: L. Antunes, S. Laplante, A. Pinto, L. Salvador 2007 Proceedings of ICITS
  • Goedel incompleteness revisited: G. Lafitte 2008 Proceedings of JAC'2008, pages: 74-89
  • Two decades of applied Kolmogorov complexity: In memoriam Andrei Nikolaevich Kolmogorov 1903 - 1987: M. Li and P. Vitányi 2010 Springer-Verlag