Skip to main content
SpringerLink
Log in

Implementation of Logical Functions in the Game of Life

  • Chapter
Collision-Based Computing

Abstract

The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generators of the mobile patterns, glider guns, in its evolution. We show how to construct basic logical operations, AND, OR, NOT in space-time configurations of the cellular automaton. Also decomposition of complicated Boolean functions is discussed. Advantages of our technique are demonstrated on an example of binary adder, realized via collision of gliders’ streams.

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

Access this chapter

Log in via an institution
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. Berlekamp E.R., Conway J.H. and Guy R. Winning Ways for Your Mathematical Playsvol 2 (Academic Press, 1982). The structures of our basic gates are introduced in this text.

    Google Scholar 

  2. Durand B. and Roka Z. The Game of Life: universality revisited Research Report 98–01 (Ecole Normale Supérieure de Lyon, Laboratoire de l’Informatique du Parallélisme, 1998)

    Google Scholar 

  3. Levy S.Artificial Life. The quest for a new creation (Penguin Books, 1992)

    Google Scholar 

  4. LogiCell Java applet http://www.nursingworld.org/alife

  5. Morita K. and Imai K. A simple self-reproducing cellular automaton with shape-encoding mechanism In: Artificial Life V (MIT Press, Cambridge, 1997) 489–496

    Google Scholar 

  6. von Neumann J. (Burks A., Editor) Theory of Self-Reproducing Automata (University of Illinois Press, 1966)

    Google Scholar 

  7. Wolfram S. Universality and complexity in cellular automata Physica D 10 (1984) 1–35.

    Article  MathSciNet  Google Scholar 

Download references

Authors
  1. Jean-Philippe Rennard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol, BS16 1QY, UK

    Andrew Adamatzky

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag London

About this chapter

Cite this chapter

Rennard, JP. (2002). Implementation of Logical Functions in the Game of Life. In: Adamatzky, A. (eds) Collision-Based Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0129-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0129-1_17

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-540-3

  • Online ISBN: 978-1-4471-0129-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation