Next:
Longest path Linear Program
Up:
Scaling of Program Fitness
Previous:
Large Random Binary Trees
Proof Trees
Two steps:
1.
consider value at each node
2.
each node as
function
subtree rooted at it implements
Bill LANGDON
2001-12-05
