Next: Example 2: n=2 bit
Up: Scaling of Program Fitness
Previous: Example: One bit AND,
- Consider each node in tree as function it implements
Rather than value
- Leafs = function select one input (y)
- Function (e.g. divide) transforms function to new function
depending upon its other argument (
)
- Transformation matrices are now much bigger but proof follows
through as before
Bill LANGDON
2001-12-05