Re: [GP] Call for Hard Benchmark Problems in Genetic Programming
- More toys: Order, Majority
Computational Complexity Analysis of Simple Genetic Programming On Two
Problems Modeling Isolated Program Semantics, FOGA 2011
- I think there's a distinction between "model" problems that we use for
theoretical research eg ORDER and Majority, Max vs what we're in search of
here: "benchmarks" that let GP extensions, alternatives, novelty be
demonstrated, tested and compared.
(And, I think "model" is more appropriate than "toy" when one considers
what their authors designed them for.)
w langdon wrote:
> More toys: Order, Majority
> Computational Complexity Analysis of Simple Genetic Programming On Two
> Problems Modeling Isolated Program Semantics, FOGA 2011
Una-May O'Reilly, PhD.
Principal Research Scientist, CSAIL, MIT