Algorithmic Prefix Complexity

  • Ming LiEmail author
  • Paul Vitányi
Part of the Texts in Computer Science book series (TCS)


While the development of an algorithmic theory of complexity according to the original definitions (plain Kolmogorov complexity) in Chap.  2 was very fruitful, for certain goals the mathematical framework is not yet satisfactory. This has resulted in a plethora of proposals of modified measures to get rid of one or the other problem. Let us list a few conspicuous inconveniences.

Copyright information

© Ming Li and Paul Vitányi 2019

Authors and Affiliations

  1. 1.University of WaterlooWaterlooCanada
  2. 2.Centrum voor Wiskunde en Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations