My watch list
my.bionity.com  

my.bionity.com

With an accout for my.bionity.com you can always see everything at a glance – and you can configure your own website and individual newsletter.

  • My watch list
  • My saved searches
  • My saved topics
  • My newsletter
Register free of charge
Login  
eng  
DeutschEnglishFrançaisEspañol

Parity benchmark



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.

References

  • Foundations of Genetic Programming


 
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Parity_benchmark". A list of authors is available in Wikipedia.
Your browser is not current. Microsoft Internet Explorer 6.0 does not support some functions on Chemie.DE