|
|
| Table 4: P(x)and µx for the One-position Schemata Implicit in Table 3 |
| | | | | | | | | | | | | | | | | | | | | |
|
|
|
|
|
|
Clearly the combination w2w1 becomes increasingly likely under ; in fact |
|
|
|
|
|
|
|
|
On the other hand, the best combination by the same calculation satisfies |
|
|
|
|
|
|
|
|
so that its probability of occurrence actually decreases. It is true that, as becomes more probable, the values of and decrease, eventually dropping below 1, but is still selected against, as the following table shows: |
|
|
|
| Table 5: µx for the Schemata of Table 4 when Instances Are Not Equilikely | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
|
|
|
|
|
|
Thus steadily decreases under , with a balance being struck among the schemata using weights {w2, w3} at position 1 and weights {w1, w2} at position 2. The lack of linkage between positions (or, equivalently, enforced operation at the equilibrium point l(x)) destroys the robustness of . |
|
|
|
|
|