Low Complexity, Low Probability Patterns and Consequences for Algorithmic Probability Applications

Figure 4

The number of 1’s in an output string vs the string’s probability. For each example map, a plot is given for just one complexity value , the second simplest, chosen to aid illustration. (a) The FST example shows a linear trend in log probability with increasing number of 1’s, using complexity 17; (b) large and small numbers of 1’s are not favoured in the time series, using 14; (c) RNA shows an overall negative relation, using 22; (d) polynomials, similar to time series, large and small numbers of 1’s are not favoured, using 19.

(a)

(b)

(c)

(d)