Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
A new paper analyzes the runtime of Cartesian Genetic Programming (CGP) when evolving Boolean functions. Researchers established an asymptotic bound of O(n D^5) for CGP to construct a conjunction of n inputs using D binary gates with strict survival selection, improving to O(n D^4) with non-strict selection. The study also proved that CGP requires exponential time to evolve an exclusive disjunction, a finding supported by experimental results. AI