Abstract
In this chapter, we look at some of the fundamental relationships between flavors of Kolmogorov complexity. The first four sections explore relationships between plain and prefix-free complexity, while the last deals with the relationship between Km and KM. Most of this material, although of independent interest, will not be used directly in the rest of this book.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Downey, R.G., Hirschfeldt, D.R. (2010). Relating Complexities. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-68441-3_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95567-4
Online ISBN: 978-0-387-68441-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)