Evolving Boolean Functions

An Application of my Genetic Algorithm

Bernard Gress

Fannie Mae

Abstract

The optimization of logic functions differs from the optimization of continuous functions because the loss function is inevitably discontinuous over the inputs. Genetic algorithms have proven successful in the fitting of smooth and continuous functions, but in this presentation I show successful applications to the fitting of fundamental logic functions to relatively complex logical systems such as multiple steps of Rule 30 automata, and various arbitrary Boolean Optimization Problems.