Parity benchmark
Jump to navigation
Jump to search
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)
|
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:
- 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.
References
Categories:
- Articles with topics of unclear notability from March 2014
- All articles with topics of unclear notability
- Neologisms articles with topics of unclear notability
- Articles lacking in-text citations from March 2014
- All articles lacking in-text citations
- Articles with multiple maintenance issues
- Genetic programming
- All stub articles
- Artificial intelligence stubs
- Robotics stubs