Top 20 strings in <i>D</i>(5) with highest frequency and therefore lowest Kolmogorov (program-size) complexity.
Fernando Soler-Toscano
Hector Zenil
Jean-Paul Delahaye
Nicolas Gauvrit
10.1371/journal.pone.0096223.t006
https://plos.figshare.com/articles/dataset/_Top_20_strings_in_D_5_with_highest_frequency_and_therefore_lowest_Kolmogorov_program_size_complexity_/1021245
<p>From frequency (middle column) to complexity (extreme right column) applying the coding theorem in order to get which we will call as our current best approximation to an experimental , that is , through the Coding theorem.</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
20
strings
highest
lowest
kolmogorov