Top 20 strings in D(5) with highest frequency and therefore lowest Kolmogorov (program-size) complexity.

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.