TODO move into latex math notes?
Kolmogorov complexity of a sequence is length of shortest possible description (program)
It’s the theoretical minimum description length (MDL)
Kolmogorov random: when K(s) ≥ len(s)
Minimum description length (MDL):