Table_3.xls (9.5 kB)

All the 2ⁿ strings for n = 7 from D(5) sorted from highest frequency (hence lowest complexity) to lowest frequency (hence highest (random) complexity).

dataset

posted on 2014-05-08, 04:12 authored by Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit

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⁷ = 128 strings.

History

Usage metrics

Keywords

Computerized simulations Computing methods Computing systems Digital computing information theory Systems science Complex systems mathematics Applied mathematics algorithms physics Statistical mechanics strings sorted highest lowest

Licence

CC BY 4.0

Exports

RefWorks

BibTeX

Ref. manager

Endnote

DataCite

NLM

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