Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barnett, L.: Tangled webs: Evolutionary dynamics on fitness landscapes with neutrality. Master’s thesis, Brighton (1997)
Imamura, K., Foster, J.A., Krings, A.W.: The test vector problem and limitations to evolving digital circuits. In: Proceedings of the 2nd NASA/DoD Workshop on Evolvable Hardware, pp. 75–80. IEEE Press, Los Alamitos (2000)
Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)
Lones, M.A.: Enzyme Genetic Programming. PhD thesis, Department of Electronics, University of York (2003)
McGregor, S.: Evolutionary and adaptive systems master’s dissertation 2004. Master’s thesis, University of Sussex (2004)
Miller, J.: What bloat? cartesian genetic programming on boolean problems. In: Late Breaking Papers, Proceedings of the 3rd Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 295–302 (2001)
Miller, J.F., Kalganova, T., Lipnitskaya, N., Job, D.: The genetic algorithm as a discovery engine: Strange circuits and new principles. In: Proceedings of the AISB Symposium on Creative Evolutionary Systems, CES 1999 (1999)
Miller, J.F., Thomson, P.: Aspects of digital evolution: Geometry and learning. In: Sipper, M., Mange, D., Pérez-Uribe, A. (eds.) ICES 1998. LNCS, vol. 1478, pp. 25–35. Springer, Heidelberg (1998)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)
Naemura, T., Hashiyama, T., Okuma, S.: Module generation for genetic programming and its incremental evolution. In: Newton, C. (ed.) Second Asia-Pacific Conference on Simulated Evolution and Learning, Australian Defence Force Academy, Canberra, Australia, pp. 24–27 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McGregor, S. (2005). How Do Evolved Digital Logic Circuits Generalise Successfully?. In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds) Advances in Artificial Life. ECAL 2005. Lecture Notes in Computer Science(), vol 3630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553090_37
Download citation
DOI: https://doi.org/10.1007/11553090_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28848-0
Online ISBN: 978-3-540-31816-3
eBook Packages: Computer ScienceComputer Science (R0)