Kolmogorov Complexity – A Primer by Jeremy Kun.
From the post:
Previously on this blog (quite a while ago), we’ve investigated some simple ideas of using randomness in artistic design (psychedelic art, and earlier randomized css designs), and measuring the complexity of such constructions. Here we intend to give a more thorough and rigorous introduction to the study of the complexity of strings. This naturally falls into the realm of computability theory and complexity theory, and so we refer the novice reader to our other primers on the subject (Determinism and Finite Automata, Turing Machines, and Complexity Classes; but Turing machines will be the most critical to this discussion).
Jeremy sets the groundwork necessary for a later post in this series. (covering machine learning)
Digest this for a couple of days and I will point out the second post.