Skip to main content

A Three-Dimensional Environment for Self-Reproducing Programs

  • Conference paper
  • First Online:
Advances in Artificial Life (ECAL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2159))

Included in the following conference series:

Abstract

Experimental results with a three-dimensional environment for self-reproducing programs are presented. The environment consists of a cube of virtual CPUs each capable of running a single process. Each process has access to the memory of 7 CPUs, to its own as well as to the memory of 6 neighboring CPUs. Each CPU has a particular orientation which may be changed using special opcodes of the machine language. An additional opcode may be used to move the CPU. We have used a standard machine language with two operands. Constants are coded in a separate section of each command and a special mutation operator is used to ensure strong causality. This type of environment sets itself apart from other types of environments in the use of redundant mappings. Individuals have read as well as write access to neighboring CPUs and reproduce by copying their genetic material. They need to move through space in order to spawn new individuals and avoid overwriting their own offspring. After a short time all CPUs are filled by self-reproducing individuals and competition between individuals sets in which results in an increased rate of speciation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Adami. Introduction to Artificial Life. Springer-Verlag, New York, 1998.

    MATH  Google Scholar 

  2. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic Programming-An Introduction: On The Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann Publishers, San Francisco, CA, 1998.

    MATH  Google Scholar 

  3. R. Davidge. Looking at life. In F. J. Varela and P. Bourgine, eds., Toward a practice of autonomous systems: Proc. of the 1st Europ. Conf. on Artificial Life, pp. 448–454, Cambridge, MA, 1992. The MIT Press.

    Google Scholar 

  4. A. K. Dewdney. Computer recreations: In the game called core war hostile programs engage in a battle of bits. Scientific American, 250(5):15–19, 1984.

    Google Scholar 

  5. A. K. Dewdney. Computer recreations: A core war bestiary of viruses, worms and other threats to computer memories. Scientific American, 252(3):14–19, 1985.

    Google Scholar 

  6. A. K. Dewdney. Computer recreations: A program called mice nibbles its way to victory at the first core war tournament. Scientific American, 256(1):8–11, 1987.

    Google Scholar 

  7. A. K. Dewdney. Computer recreations: Of worms, viruses and core war. Scientific American, 260(3):90–93, 1989.

    Article  Google Scholar 

  8. P. Dittrich, M. Wulf, and W. Banzhaf. A vital two-dimensional assembler automaton. In C. C. Maley and E. Boudreau, eds., Artificial Life VII Workshop Proceedings, 2000.

    Google Scholar 

  9. M. Ebner. On the search space of genetic programming and its relation to nature’s search space. In Proc. of the 1999 Congress on Evolutionary Computation, Washington, D.C., pp. 1357–1361. IEEE Press, 1999.

    Google Scholar 

  10. M. Ebner, P. Langguth, J. Albert, M. Shackleton, and R. Shipman. On neutral networks and evolvability. In Proc. of the 2001 Congress on Evolutionary Computation, Seoul, Korea. IEEE Press, 2001.

    Google Scholar 

  11. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Reading, MA, 1989.

    MATH  Google Scholar 

  12. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Mateo, CA, 1990.

    Google Scholar 

  13. J. H. Holland. Adaptation in natural and artifical systems: an introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  14. M. A. Huynen. Exploring phenotype space through neutral evolution. Journal of Molecular Evolution, 43:165–169, 1996.

    Article  Google Scholar 

  15. S. A. Kauffman. The Origins of Order. Oxford University Press, Oxford, 1993.

    Google Scholar 

  16. M. Kimura. Population Genetics, Molecular Evolution, and the Neutral Theory: Selected Papers. The University of Chicago Press, Chicago, 1994.

    Google Scholar 

  17. J. R. Koza. Genetic Programming. The MIT Press, Cambridge, MA, 1992.

    MATH  Google Scholar 

  18. J. R. Koza. Genetic Programming II. The MIT Press, Cambridge, MA, 1994.

    MATH  Google Scholar 

  19. M. M. Mano. Computer System Architecture. Prentice-Hall, Englewood Cliffs, NJ, 3rd ed., 1993.

    Google Scholar 

  20. M. Mitchell. An Introduction to Genetic Algorithms. The MIT Press, Cambridge, MA, 1996.

    Google Scholar 

  21. A. N. Pargellis. The evolution of self-replicating computer organisms. Physica D, 98:111–127, 1996.

    Article  MATH  Google Scholar 

  22. A. N. Pargellis. The spontaneous generation of digital ”life”. Physica D, 91:86–96, 1996.

    Article  MATH  Google Scholar 

  23. S. Rasmussen, C. Knudsen, and R. Feldberg. Dynamics of programmable matter. In C. G. Langton, C. Taylor, J. D. Farmer, and S. Rasmussen, eds., Artificial Life II: SFI Studies in the Sciences of Complexity, Vol. X, pp. 211–254, Redwood City, CA, 1991. Addison-Wesley.

    Google Scholar 

  24. S. Rasmussen, C. Knudsen, R. Feldberg, and M. Hindsholm. The coreworld: emergence and evolution of cooperative structures in a computational chemistry. Physica D, 42:111–134, 1990.

    Article  Google Scholar 

  25. T. S. Ray. An approach to the synthesis of life. In C. G. Langton, C. Taylor, J. D. Farmer, and S. Rasmussen, eds., Artificial Life II: SFI Studies in the Sciences of Complexity, Vol. X, pp. 371–408, Redwood City, CA, 1991. Addison-Wesley.

    Google Scholar 

  26. T. S. Ray. Is it alive or is it ga? In R. K. Belew and L. B. Booker, eds., Proc. of the 4th Int. Conf. on Genetic Algorithms, University of California, SD, pp. 527–534, San Mateo, CA, 1991. Morgan Kaufmann Publishers.

    Google Scholar 

  27. T. S. Ray. Synthetic life: Evolution and optimization of digital organisms. In K. R. Billingsley, H. U. Brown III, and E. Derohanes, eds., Scientific Excellence in Supercomputing, pp. 489–531, Athens, GA, 1992. The Baldwin Press.

    Google Scholar 

  28. T. S. Ray. Evolution and complexity. In G. Cowan, D. Pines, and D. Meltzer, eds., Complexity: Metaphors, Models, and Reality. SFI Studies in the Sciences of Complexity, Proc. Vol. XIX, pp. 161–176. Addison-Wesley, 1994.

    Google Scholar 

  29. T. S. Ray. Selecting naturally for differentiation. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, eds., Genetic Programming 1997, Proc. of the 2nd Annual Conf., July 13–16, 1997, Stanford University, pp. 414–419, San Francisco, CA, 1997. Morgan Kaufmann Publishers.

    Google Scholar 

  30. T. S. Ray and J. F. Hart. Evolution of differentiation in multithreaded digital organisms. In M. A. Bedau, J. S. McCaskill, N. H. Packard, and S. Rasmussen, eds., Artificial Life VII, Proc. of the 7th Int. Conf. on Artificial Life, pp. 132–140, Cambridge, MA, 2000. The MIT Press.

    Google Scholar 

  31. I. Rechenberg. Evolutions strategie’ 94. frommann-holzboog, Stuttgart, 1994.

    Google Scholar 

  32. M. Shackleton, R. Shipman, and M. Ebner. An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proc. of the 2000 Congress on Evolutionary Computation, La Jolla, CA, pp. 493–500. IEEE Press, 2000.

    Google Scholar 

  33. R. Shipman. Genetic redundancy: Desirable or problematic for evolutionary adaptation? In A. Dobnikar, N. C. Steele, D. W. Pearson, and R. F. Albrecht, eds., 4th Int. Conf. on Artificial Neural Networks and Genetic Algorithms, pp. 337–344, New York, 1999. Springer-Verlag.

    Google Scholar 

  34. R. Shipman, M. Shackleton, M. Ebner, and R. Watson. Neutral search spaces for artificial evolution: A lesson from life. In M. A. Bedau, S. Rasmussen, J. S. McCaskill, and N. H. Packard, eds., Artificial Life: Proc. of the 7th Int. Conf. on Artificial Life. MIT Press, 2000.

    Google Scholar 

  35. M. Sipper. Fifty years of research on self-replication: An overview. Artificial Life, 4:237–257, 1998.

    Article  Google Scholar 

  36. J. Skipper. The computer zoo-evolution in a box. In F. J. Varela and P. Bourgine, eds., Toward a practice of autonomous systems: Proc. of the 1st Europ. Conf. on Artificial Life, pp. 355–364, Cambridge, MA, 1992. The MIT Press.

    Google Scholar 

  37. E. van Nimwegen, J. P. Crutchfield, and M. Huynen. Neutral evolution of mutational robustness. Proc. Natl. Acad. Sci. USA, 96:9716–9720, 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ebner, M. (2001). A Three-Dimensional Environment for Self-Reproducing Programs. In: Kelemen, J., Sosík, P. (eds) Advances in Artificial Life. ECAL 2001. Lecture Notes in Computer Science(), vol 2159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44811-X_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-44811-X_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42567-0

  • Online ISBN: 978-3-540-44811-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics