The Best Writing on Mathematics 2015

by Mircea Pitici

Informally, the Kolmogorov complexity of a sequence x, abbreviated K(x), is defined to be the number of bits in the shortest computer program whose output is x.