Contrary to indications made by prior researchers, digital logic circuits designed by artificial evolution to perform binary arithmetic tasks can generalise on inputs which were not seen during evolution. This phenomenon is demonstrated experimentally and speculatively explained in terms of the regular structure of binary arithmetic tasks and the nonoptimality of random circuits. This explanation rests on an assumption that evolution is relatively unbiased in its exploration of circuit space. Further experimental data is provided to support the proposed explanation. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
McGregor, S. (2005). How do evolved digital logic circuits generalise successfully? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3630 LNAI, pp. 363–372). https://doi.org/10.1007/11553090_37
Mendeley helps you to discover research relevant for your work.