1. References

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

• 1½ Knights – In Search of the Ravishing Princess Herzelinde
• 1½ Ritter - Auf der Suche nach der hinreißenden Herzelinde
• 1 × 1
• 1×1=1
• 1×1=1 (TO BE ONE)
• 1×1=1 (To Be One)
• 1÷0
• 1÷x=1 (Undivided)
• 1. česká národní hokejová liga
• 1 Şişe Aşk
• 1-й Кавказский армейский корпус
• 1-й Кавказский кавалерийский корпус
• 1–11 Oakley Street
• 1–23 Edwardes Square
• 1–23 Warwick Square
• 1–2 July 2016 Dhaka attack
• 1–50 series (Chicago "L")
• 1–5 and 6 Sydney Place
• 1–6 Priory Street, Monmouth
• 1–7 Montpelier Square
• 1–800 Dinosaur
• 1–8 Porchester Square
• 1′C1′
• 1′C+C1′
• 1′Co1′