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.

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) The topic of this article may not meet Wikipedia's notability guideline for neologisms. (March 2014) This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (March 2014)

• Foundations of Genetic Programming

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e

This robotics-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e