Table 1.
m | Evolutionary Target | Minimal Coding Example | |
---|---|---|---|
(a) | 13 | f(x, y) = x3 + y3 + 5x2 | (+ (* (* (+ x 5) x) x) (* (* y y) y)) |
(b) | 15 | f(x, y) = x3 + y3 + 5x2 + xy | (+ (* (+ (* y y) x) y) (* (* (+ 5 x) x) x)) |
(c) | 15 | f(x, y) = x3 + y3 + 5x2 + 2y2 | (+ (* x (* (+ 5 x) x)) (* (* y (+ 2 y)) y)) |
(d) | 19 | f(x, y) = y4 + x3 + y3 + yx2 + y2 | (+ (* (* x x) (+ x y)) (* (* (+ (+ y 1) (* y y)) y) y)) |
Evolutionary targets with corresponding minimal coding length m needed to code for them. In the last column an example of a genome with the minimal length coding for such a full solution.