Parity benchmark

Part of a series on the
Evolutionary algorithm
  • Artificial development
  • Artificial life
  • Cellular evolutionary algorithm
  • Cultural algorithm
  • Differential evolution
  • Effective fitness
  • Evolutionary computation
  • Evolution strategy
  • Gaussian adaptation
  • Grammar induction
  • Evolutionary multimodal optimization
  • Particle swarm optimization
  • Memetic algorithm
  • Natural evolution strategy
  • Neuroevolution
  • Promoter based genetic algorithm
  • Spiral optimization algorithm
  • Self-modifying code
  • Polymorphic code
Genetic algorithm
Genetic programming
  • v
  • t
  • e
(Learn how and when to remove this 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


Stub icon

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

  • v
  • t
  • e
Stub icon

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

  • v
  • t
  • e