Parity benchmark
From Wikipedia, the free encyclopedia
 |
This article is orphaned as few or no other articles link to it. Please help introduce links in articles on related topics. (November 2006) |
Parity problems are widely used as Benchmark problems widely 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:
- a very simple artificial neural network cannot solve it and
- all inputs need to be considered and a change to any one of them changes the answer.
