Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
The nature of statistical learning theory
The nature of statistical learning theory
On resource-bounded instance complexity
Theoretical Computer Science
The evolution of size and shape
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!
Minds and Machines
Resource-Bounded Kolmogorov Complexity Revisited
SIAM Journal on Computing
Some Considerations on the Reason for Bloat
Genetic Programming and Evolvable Machines
Complexity Compression and Evolution
Proceedings of the 6th International Conference on Genetic Algorithms
Lexicographic Parsimony Pressure
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Exons and Code Growth in Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Avoiding the Bloat with Stochastic Grammar-Based Genetic Programming
Selected Papers from the 5th European Conference on Artificial Evolution
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Balancing accuracy and parsimony in genetic programming
Evolutionary Computation
Effects of code growth and parsimony pressure on populations in genetic programming
Evolutionary Computation
Dynamic maximum tree depth: a simple technique for avoiding bloat in tree-based GP
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
| Hi-index | 0.00 |
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tricks from GP and also provides complexity lower-bounds which justify the computational cost of GP thanks to the use of Kolmogorovs complexity in bounded time.