“…Encoding arguments, now commonly framed under the so-called incompressibility method, sprouted from the study of information complexity as introduced by Kolmogorov, Solomonoff, and Chaitin. This technique has been fruitful in recent history, perhaps most famously being used to give the first nontrivial lower bound for the average running time of Shellsort, and for providing a constructive version of the Lovász local lemma [5,6,20,28,39].…”