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.
Cite
CITATION STYLE
Langdon, W. B., & Poli, R. (1999). Boolean functions fitness spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1598, pp. 1–14). Springer Verlag. https://doi.org/10.1007/3-540-48885-5_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
