Kolmogorov Complexity in Combinatory Logic
Online article by John Tromp. Kolmogorov complexity is a recursion theoretic characterisation of randomness.

No queries for www.cwi.nl/~tromp/cl/cl.html