Parity benchmark

From Wikipedia, the free encyclopedia

You have new messages (last change).
There are very few or no other articles that link to this one.
Please help introduce links in articles on related topics. After links have been created, remove this message.
This article has been tagged since 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:

  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.

[edit] References


Comp Sci logo This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../p/a/r/Parity_benchmark.html"