Program Representation
GP evolves computer programs, traditionally represented in memory as tree structures. Trees can be easily evaluated in a recursive manner. Every tree node has an operator function and every terminal node has an operand, making mathematical expressions easy to evolve and evaluate. Thus traditionally GP favors the use of programming languages that naturally embody tree structures (for example, Lisp; other functional programming languages are also suitable).
Non-tree representations have been suggested and successfully implemented, such as linear genetic programming which suits the more traditional imperative languages . The commercial GP software Discipulus uses automatic induction of binary machine code ("AIM") to achieve better performance. µGP uses directed multigraphs to generate programs that fully exploit the syntax of a given assembly language.
Read more about this topic: Genetic Programming
Famous quotes containing the word program:
“When Paul Bunyan’s loggers roofed an Oregon bunkhouse with shakes, fog was so thick that they shingled forty feet into space before discovering they had passed the last rafter.”
—State of Oregon, U.S. public relief program (1935-1943)