< previous page page_135 next page >

Page 135
Table 4: P(x)and µx for the One-position Schemata Implicit in Table 3
x
P(x)
mx
C0151-01.gif
1/3
0.9
C0151-02.gif
1/3
1.1
C0151-03.gif
1/3
1.0
C0151-04.gif
1/3
1.1
C0151-05.gif
1/3
1.0
C0151-06.gif
1/3
0.9

Clearly the combination w2w1 becomes increasingly likely under C0151-15.gif; in fact
C0151-07.gif
On the other hand, the best combination C0151-08.gif by the same calculation satisfies
C0151-09.gif
so that its probability of occurrence actually decreases. It is true that, as C0151-10.gif becomes more probable, the values of C0151-11.gif and C0151-12.gif decrease, eventually dropping below 1, but C0151-13.gifis still selected against, as the following table shows:

Table 5: µx for the Schemata of Table 4 when Instances Are Not Equilikely
x
P(x)
mx
P(x)
mx
C0151-01.gif
0.01
0.620
0.01
0.066
C0151-02.gif
0.90
0.982
0.09
1.080
C0151-03.gif
0.09
1.270
0.90
0.947
C0151-04.gif
0.90
0.982
0.09
1.080
C0151-05.gif
0.09
1.270
0.90
0.947
C0151-06.gif
0.01
0.620
0.01
0.066

Thus C0151-14.gifsteadily decreases under C0151-15.gif, 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 C0151-15.gif.

 
< previous page page_135 next page >

If you like this book, buy it!