Next: Summary: Long Random Linear
Up: Scaling of Program Fitness
Previous: Turing Compete: recursion or
So what?
- ``Random Trees'' a few inputs near root,
some functions may need bushy trees
(e.g. parity)
commoner in full trees.
- Depth limit promotes near full trees rather than random
- Size limit promotes asymmetric trees. Good for data mining??
- Density of solutions indication problem difficulty
- No point searching above threshold?
- Predict where threshold is?
Bill LANGDON
2001-12-05