Kolmogorov Complexity of Finite Strings

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