Abstract
This chapter is a brief introduction to Kolmogorov complexity and the theory of algorithmic randomness for finite strings. We will concentrate on a few fundamental aspects, in particular ones that will be useful in dealing with our main topic, the theory of algorithmic randomness for infinite sequences
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
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Downey, R.G., Hirschfeldt, D.R. (2010). Kolmogorov Complexity of Finite Strings. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-68441-3_3
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)