Parity benchmark

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Parity problems are widely used as benchmark problems in genetic programming but inherited from the artificial neural network community. Parity is calculated by summing all the binary inputs and reporting if the sum is odd or even. This is considered difficult because:

  1. a very simple artificial neural network cannot solve it, and
  2. all inputs need to be considered and a change to any one of them changes the answer.