Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Ming Li and Paul Vitányi
About this chapter
Cite this chapter
Li, M., Vitányi, P. (2019). Algorithmic Prefix Complexity. In: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-11298-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-11298-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11297-4
Online ISBN: 978-3-030-11298-1
eBook Packages: Computer ScienceComputer Science (R0)