Boolean Functions Fitness Spaces

  • Authors:
  • William B. Langdon;Riccardo Poli

  • Affiliations:
  • -;-

  • Venue:
  • Proceedings of the Second European Workshop on Genetic Programming
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the distribution of performance of the Boolean functions of 3 Boolean inputs (particularly that of the parity functions), the always-on-6 and even-6 parity functions. We use enumeration, uniform Monte-Carlo random sampling and sampling random full trees. As expected XOR dramatically changes the fitness distributions. In all cases once some minimum size threshold has been exceeded, the distribution of performance is approximately independent of program size. However the distribution of the performance of full trees is different from that of asymmetric trees and varies with tree depth.