Skip to main content
SpringerLink
Log in

Using genetical and cultural search to design unorganised machines

  • Special Issue
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

In 1948 Turing presented a general representation scheme by which to achieve artificial intelligence—his unorganised machines. Significantly, these were a form of discrete dynamical system and yet dynamical representations remain almost unexplored within evolutionary computation. Further, at the same time as also suggesting that natural evolution may provide inspiration for search mechanisms to design machines, he noted that mechanisms inspired by the social aspects of learning may prove useful. This paper presents results from an investigation into using Turing’s dynamical representation designed by Evolutionary Programming and a new imitation-based, i.e., cultural, approach. Moreover, the original synchronous and an asynchronous form of unorganised machines are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Abbeel P, Ng A (2004) Apprenticeship learning via inverse reinforcement learning. In: Proceedings of the 21st international conference on machine learning, ACM Press, pp 1–8

  2. Andre D, Koza JR, Bennett FH, Keane M (1999) Genetic programming III. MIT Press, Cambridge

    MATH  Google Scholar 

  3. Angeline P (1998) Evolutionary optimization versus particle swarm optimization. In: Porto VW et al (eds) Proceedings of evolutionary programming 7. Springer, Berlin, pp 601–610

    Chapter  Google Scholar 

  4. Angeline P, Saunders G, Pollock J (1994) An evolutionary algorithm that constructs recurrent neural networks. IEEE Trans Neural Netw 5:54–65

    Article  Google Scholar 

  5. Atkeson CG, Schaal S (1997) Robot learning from demonstration. In: Proceedings of the fourteenth international conference on machine learning, Morgan Kaufmann, pp 12–20

  6. Billard A, Dautenhahn K (1999) Experiments in learning by imitation—grounding and use of communication in robotic agents. Adapt Behav 7(3/4):415–438

    Article  Google Scholar 

  7. Blackmore S (1999) The meme machine. Oxford

  8. Brave S (1996) Evolving deterministic finite automata using cellular encoding. In: Koza JR et al (eds) Proceedings of the first annual conference on genetic programming. MIT Press, Cambridge, pp 39–44

    Google Scholar 

  9. Bull L (2008) Toward artificial creativity with evolution strategies. In: Parmee I (ed) Adaptive computing in design and manufacture VIII, IPCC (CD)

  10. Bull L (2009) On dynamical genetic programming: simple boolean networks in learning classifier systems. Int J Parallel Emergent Distribut Syst 24(5):421–442

    Article  MathSciNet  MATH  Google Scholar 

  11. Chellapilla K (1997) Evolving computer programs without subtree crossover. IEEE Trans Evol Comput 1(1):209–216

    Article  Google Scholar 

  12. Cramer N (1985) A representation for the adaptive generation of simple sequential programs. In: Grefenstette JJ (ed) Proceedings of an international conference on genetic algorithms and their application, Lawrence Erlbaum, pp 183–187

  13. Copeland J, Proudfoot D (1996) On Alan Turing’s anticipation of connectionism. Synthese 108:361–377

    Article  MathSciNet  MATH  Google Scholar 

  14. Dawkins R (1976) The selfish gene. Oxford

  15. Di J, Lala P (2007) Cellular array-based delay insensitive asynchronous circuits design and test for nanocomputing systems. J Elect Testing 23:175–192

    Article  Google Scholar 

  16. Dolan C, Dyer M (1987) Toward the evolution of symbols. In: Grefenstette JJ (ed) Proceedings of the second international conference on genetic algorithms, Lawrence Erlbaum, pp 123–131

  17. Friedberg RM (1958) A learning machine: part I. IBM J Res Dev 2(1):2–13

    Article  MathSciNet  Google Scholar 

  18. Fogel LJ, Owens AJ, Walsh MJ (1965) Artificial intelligence through a simulation of evolution. In: Maxfield M et al (eds) Biophysics and cybernetic systems: proceedings of the 2nd cybernetic sciences symposium, Spartan Books, pp 131–155

  19. Forsyth R (1981) BEAGLE: a Darwinian approach to pattern recognition. Kybernetes 10:159–166

    Article  MathSciNet  Google Scholar 

  20. Galvan-Lopez E (2008) Efficient graph-based genetic programming representation with multiple outputs. Int J Autom Comput 5(1):81–89

    Article  Google Scholar 

  21. Gorman B, Humphreys M (2006) Towards integrated imitation of strategic planning and motion modeling in interactive computer games. Computers in Entertainment 4(4) Article 10

  22. Gruau F, Whitley D (1993) Adding learning to the cellular development process. Evol Comput 1(3):213–233

    Article  Google Scholar 

  23. Harvey I (1992) Species adaptation genetic algorithms: a basis for a continuing SAGA. In: Varela F, Bourgine P (eds) Proceedings of 1st European conference on artificial life. MIT Press, Cambridge, pp 346–354

    Google Scholar 

  24. Hassdijk E, Vogt P, Eiben A (2008) Social learning in population-based adaptive systems. In: Proceedings of the 2008 IEEE congress on evolutionary computation, IEEE Press, New York, pp 1276–1282

  25. Hirasawa K, Okubo M, Katagari H, Hu J, Murata J (2001) Comparison between genetic network programming (GNP) and genetic programming (GP). In: Proceedings of the 2001 congress on evolutionary computation, IEEE Press, New York, pp 1276–1282

  26. Holland JH (1975) Adaptation in natural and artificial systems. Univ. of Mich. Press, Michigan

    Google Scholar 

  27. Hutchins E, Hazelhurst B (1990) Learning in the cultural process. In: Langton CG et al (eds) Artificial life II. Addison Wesley, Boston, pp 689–706

    Google Scholar 

  28. Kauffman SA (1993) The origins of order. Oxford

  29. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, IEEE Press, pp 1942–1948

  30. Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE international conference on systems, man and cybernetics, IEEE Press, pp 4104–4108

  31. Koza JR (1992) Genetic programming. MIT Press, Cambridge

    MATH  Google Scholar 

  32. Luerssen M, Powers D (2005) Graph composition in a graph grammar-based method for automata network evolution. In: Proceedings of the 2005 IEEE congress on evolutionary computation, IEEE Press, pp 1653–1660

  33. Luke S, Spector L (1996) Evolving graphs and networks with edge encoding: preliminary report. In: Koza JR (ed) Late breaking papers at the genetic programming 1996 conference, Stanford University, pp 117–124

  34. McCulloch WS, Pitts W (1943) A logical calculus of the ideas immanent in nervous activity. Bull Math Biophys 5:115–133

    Article  MathSciNet  MATH  Google Scholar 

  35. Metivier M, Lattaud L (2009) Imitation guided learning in learning classifier systems. Nat Comput 8(1):29–56

    Article  MathSciNet  MATH  Google Scholar 

  36. Miller J (1999) An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Banzhaf W, Daida J, Eiben AE, Garzon MH, Honavar V, Jakiela M, Smith RE (eds) Proceedings of the genetic and evolutionary computation conference—GECCO-99. Morgan Kaufmann, Massachusetts, pp 1135–1142

    Google Scholar 

  37. Mitchell M, Hraber P, Crutchfield J (1993) Revisiting the edge of chaos: evolving cellular automata to perform computations. Complex Syst 7:83–130

    Google Scholar 

  38. Nakamura K (1974) Asynchronous cellular automata and their computational ability. Syst Comput Controls 5(5):58–66

    Google Scholar 

  39. Niehaus J, Banzhaf W (2001) Adaption of operator probabilities in genetic programming. In: Miller J, Tomassini M, Lanzi P-L, Ryan C, Tettamanzi A, Langdon W (eds) Proceedings of Euro GP. Springer, Berlin, pp 325–336

    Google Scholar 

  40. Packard N (1988) Adaptation toward the edge of chaos. In: Kelso J, Mandell A, Shlesinger M (eds) Dynamic patterns in complex systems. World Scientific, New Jersey, pp 293–301

    Google Scholar 

  41. Parisi D (1997) Cultural evolution in neural networks. IEEE Expert Intell Syst Appl 12(4):9–11

    Google Scholar 

  42. Poli R (1997) Evolution of graph-like programs with parallel distributed programming. In: Back T (ed) Proceedings of the seventh international conference on genetic algorithms. Morgan Kaufmann, Massachusetts, pp 346–353

    Google Scholar 

  43. Poli R (1999) Parallel distributed genetic programming. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimisation. McGraw-Hill, New York, pp 403–431

    Google Scholar 

  44. Price B, Boutilier C (1999) Implicit imitation in multi-agent reinforcement learning. In: Proceedings of the sixteenth international conference on machine learning. Morgan Kaufmann, pp 325–334

  45. Reynolds R (1994) An Introduction to Cultural Algorithms. In: Sebald AV, Fogel LJ (eds) Proceedings of the 3rd annual conference on evolutionary programming. World Scientific Publishing, New Jersey, pp 131–139

    Google Scholar 

  46. Rivero D, Dorado J, Rabunal J, Pazos A, Pereira J (2006) Artificial neural network development by means of genetic programming with graph codification. Proc World Acad Sci Eng Technol 15:209–214

    Google Scholar 

  47. Sapin E, Bailleux O, Chabrier J (2003) Research of a cellular automaton simulating logic gates by evolutionary algorithms. In: Proceedings of Euro GP, Springer, pp 414–423

  48. Schmidt M, Lipson H (2007) Comparison of tree and graph encodings as function of problem complexity. In: Proceedings of the genetic and evolutionary computation conference—GECCO-07, ACM Press, pp 1674–1679

  49. Sipper M (1997) Evolution of parallel cellular machines. Springer, Berlin

    Google Scholar 

  50. Sipper M, Tomassini M, Capcarrere S (1997) Evolving asynchronous and scalable non-uniform cellular automata. In: Proceedings of the third international conference on artificial neural networks and genetic algorithms, Springer, Berlin, pp 66–70

  51. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359

    Article  MathSciNet  MATH  Google Scholar 

  52. Strukov DB, Snider GS, Stewart DR, Williams RS (2008) The missing memristor found. Nature 453:80–83

    Article  Google Scholar 

  53. Sylvain C, Billard A (2009) Statistical learning by imitation of competing constraints in joint space and task space. Adv Robot 23(15):2059–2076

    Article  Google Scholar 

  54. Teller A, Veloso M (1996) Neural programming and an internal reinforcement policy. In: Koza JR (ed) Late breaking papers at the genetic programming 1996 conference. Stanford University, Stanford, pp 186–192

    Google Scholar 

  55. Teuscher C (2002) Turing’s connectionism. Springer, Berlin

    Book  Google Scholar 

  56. Toth R, Stone C, De Lacy Costello B, Adamatzky A, Bull L (2008) Dynamic control and information processing in the Belousov-Zhabotinsky reaction using a co-evolutionary algorithm. J Chem Phys 129:184708

    Article  Google Scholar 

  57. Turing A (1948) Intelligent machinery. See pages 395–432 in [13]

  58. Turing A (1968) Intelligent machinery. In: Evans CR, Robertson A (eds) Key papers: cybernetics. Butterworths, London, pp 91–102

    Google Scholar 

  59. Von Neumann J (1966) The theory of self-reproducing automata. University of Illinois, Illinois

    Google Scholar 

  60. Werner T, Akella V (1997) Asynchronous processor survey. Computing 30(11):67–76

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by EPSRC Grant no. EP/H014381/1.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of the West of England, Bristol, BS16 1QY, UK

    Larry Bull

Authors
  1. Larry Bull
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Larry Bull.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bull, L. Using genetical and cultural search to design unorganised machines. Evol. Intel. 5, 23–33 (2012). https://doi.org/10.1007/s12065-011-0061-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-011-0061-4

Keywords

Search

Navigation