Skip to main content

Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction

  • Conference paper
  • 624 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6501))

Abstract

The quest for artificial self-reproduction dates back to the end of the 1940’s and started with the work of John von Neumann on self-reproducing cellular automata. Nowadays (artificial) self-reproduction is one of the cornerstones of automata theory, which plays an important role in the field of molecular nanotechnology. We briefly summarize the development on the research subject of artificial self-reproduction starting with von Neumann’s ideas. Moreover, we pay special attention to the concepts of trivial and non-trivial self-reproduction by Herman, Langton, and others. Our tour on the subject obviously lacks completeness and it reflects our personal view of what constitute the most interesting links to the important aspects of artificial self-reproduction.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amoroso, S., Cooper, G.: Tesselation structures for reproduction of arbitrary patterns. J. Comput. System Sci. 5, 455–464 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arbib, M.A.: Simple self-reproducing universal automata. Inform. Control 9, 177–189 (1966)

    Article  MATH  Google Scholar 

  3. Banks, E.R.: Information processing and transmission in cellular automata. Technical Report MAC TR-81, MIT (1971)

    Google Scholar 

  4. Berlekamp, E.R., Conway, J.H., Guy, R.K.: What is Life? In: Winning Ways for your Mathematical Plays?, vol. 2, ch. 25, pp. 817–850. Academic Press, London (1982)

    Google Scholar 

  5. Burks, A.W.: Von Neumann’s self-reproducing automata. In: Burks, A.W. (ed.) Essays on Cellular Automata, pp. 3–64. University of Illinois Press, Urbana (1970)

    Google Scholar 

  6. Codd, E.F.: Cellular Automata. Academic Press, New York (1968)

    MATH  Google Scholar 

  7. Gardner, M.: The fantastic combinations of John Conway’s new solitaire game ‘life’. Sci. Amer. 223, 120–123 (1970)

    Article  Google Scholar 

  8. Hamilton, W.L., Mertens Jr., J.R.: Reproduction in tesselation structures. J. Comput. System Sci. 10, 248–252 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Herman, G.T.: On universal computer-constructors. Inform. Process. Lett. 2, 61–64 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Langton, C.G.: Self-reproduction in cellular automata. Phys. D 10, 135–144 (1984)

    Article  MATH  Google Scholar 

  11. Moore, E.F.: Machine models of self-reproduction. Proc. Symposia in Applied Mathematics 14, 17–33 (1962)

    Article  MATH  Google Scholar 

  12. Morita, K., Imai, K.: Self-reproduction in a reversible cellular space. Theoret. Comput. Sci. 168, 337–366 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ostrand, T.J.: Pattern reproduction in tesselation automata of arbitrary dimension. J. Comput. System Sci. 5, 623–628 (1971)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  15. Thatcher, J.W.: Universality in the von neumann cellular model. Technical Report 06376, 06689, 03105-30-T, University of Michigan (1964)

    Google Scholar 

  16. Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc., Series 2 42, 230–265 (1936)

    MathSciNet  MATH  Google Scholar 

  17. Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc., Series 2 43, 544–546 (1937)

    MathSciNet  MATH  Google Scholar 

  18. von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press, Urbana (1966)

    Google Scholar 

  19. Wainwright, R.T.: Life is universal!. In: Winter Simulation Conference (WSC 1974). WSC/SIGSIM, vol. 2, pp. 449–459 (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holzer, M., Kutrib, M. (2010). Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. CMC 2010. Lecture Notes in Computer Science, vol 6501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18123-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18123-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18122-1

  • Online ISBN: 978-3-642-18123-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics