Abstract
While the development of an algorithmic theory of complexity according to the original definitions (plain Kolmogorov complexity) in Chapter 2 was very fruitful, in certain ways 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.
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
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Li, M., Vitányi, P. (1993). Algorithmic Prefix Complexity. In: An Introduction to Kolmogorov Complexity and Its Applications. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3860-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3860-5_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3862-9
Online ISBN: 978-1-4757-3860-5
eBook Packages: Springer Book Archive