Genetic Programming: A Paradigm For Genetically Breeding Populations Of Computer Programs To Solve Problems (1990)
| Citations: | 132 - 24 self |
BibTeX
@MISC{Koza90geneticprogramming:,
author = {John Koza},
title = {Genetic Programming: A Paradigm For Genetically Breeding Populations Of Computer Programs To Solve Problems},
year = {1990}
}
Years of Citing Articles
OpenURL
Abstract
Many seemingly different problems in artificial intelligence, symbolic processing, and machine learning can be viewed as requiring discovery of a computer program that produces some desired output for particular inputs. When viewed in this way, the process of solving these problems becomes equivalent to searching a space of possible computer programs for a most fit individual computer program. The new genetic programming paradigm described herein provides a way to search for this most fit individual computer program. In this new genetic programming paradigm, populations of computer programs are genetically bred using the Darwinian principle of survival of the fittest and using a genetic crossover (recombination) operator appropriate for genetically mating computer programs. In this paper, the process of formulating and solving problems using this new paradigm is illustrated using examples from various areas.







