Parity benchmark

This article has multiple issues. Please help 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. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources:  –  ·  ·  · scholar · JSTOR (March 2014) (Learn how and when to remove this template message) This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. Please help to improve this article by introducing more precise citations. (March 2014) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

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.

References[]

• Foundations of Genetic Programming

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

• v
• t

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

• v
• t