Using uniform random search and
taking the maximum value for **P** gives us a minimum figure of 450,000
for programs of length 18.
However if we allow longer programs,
**P** falls producing a corresponding rise in **E** to 1,200,000 with
programs of size 25 and 2,700,000 with programs of size 50 and
4,900,000 for sizes of 500.
(In the ant problem as well as reducing the chance of success,
longer random programs also require more machine resources to evaluate).

Tue Feb 3 19:53:29 GMT 1998