%0 Generic %A Soler-Toscano, Fernando %A Zenil, Hector %A Delahaye, Jean-Paul %A Gauvrit, Nicolas %D 2014 %T 20 random strings (sorted from lowest to highest complexity values) from the first half of D(5) to which the coding theorem has been applied (extreme right column) to approximate K(s). %U https://plos.figshare.com/articles/dataset/_20_random_strings_sorted_from_lowest_to_highest_complexity_values_from_the_first_half_of_D_5_to_which_the_coding_theorem_has_been_applied_extreme_right_column_to_approximate_K_s_/1021246 %R 10.1371/journal.pone.0096223.t007 %2 https://plos.figshare.com/ndownloader/files/1490975 %K Computerized simulations %K Computing methods %K Computing systems %K Digital computing %K information theory %K Systems science %K Complex systems %K mathematics %K Applied mathematics %K algorithms %K physics %K Statistical mechanics %K strings %K lowest %K highest %K coding %K theorem %K been %K applied %K approximate %X

20 random strings (sorted from lowest to highest complexity values) from the first half of D(5) to which the coding theorem has been applied (extreme right column) to approximate K(s).

%I PLOS ONE