An Empirical Study of the Efficiency of Learning Boolean Functions

A new form of Genetic Programming (GP) called Cartesian Genetic Programming (CGP) is proposed in which programs are represented by linear integer chromosomes in the form of connections and functionalities of a rectangular array of primitive functions. The effectiveness of this approach is investigated for boolean evenparity functions (3,4,5), and the 2-bit multiplier