All the 2<i><sup>n</sup></i> strings for <i>n</i> = 7 from <i>D</i>(5) sorted from highest frequency (hence lowest complexity) to lowest frequency (hence highest (random) complexity). Fernando Soler-Toscano Hector Zenil Jean-Paul Delahaye Nicolas Gauvrit 10.1371/journal.pone.0096223.t003 https://plos.figshare.com/articles/dataset/_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_/1021249 <p>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<sup>7</sup> = 128 strings.</p> 2014-05-08 04:12:47 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