So what?

• Importance of ad-hoc heuristic (write protection)

  Random linear programs v. random tree programs, cf. Discipulus.

• Chance of finding a general solution is exponentially small.
• Density of solutions gives indication problem difficulty
• No point searching above threshold?

• larger programs $\rightarrow$ smoother landscape, by denser neutral networks (without fitness gradient to guide search)