## All the 2^{n} strings for *n* = 7 from *D*(5) sorted from highest frequency (hence lowest complexity) to lowest frequency (hence highest (random) complexity).

^{n}

2014-05-08T04:12:47Z (GMT)
by

Strings in each row have the same frequency (hence the same Kolmogorov complexity). There are 31 different groups representing the different complexities of the 2^{7} = 128 strings.

#### Categories

#### License

CC BY 4.0