Skip to main content
SpringerLink
Log in

The Extended Glider-Eater Machine in the Spiral Rule

  • Conference paper
Unconventional Computation (UC 2010)

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

Included in the following conference series:

Abstract

We investigate the glider-eater interaction in a 2-dimensional reaction-diffusion cellular automaton, the Adamatzky-Wuensche Spiral Rule. We present the complete state transition table of such interactions, with which one can build the extended glider-eater machine composed of multiple instances of gliders and eaters to compute in specific problems. We demonstrate the implementation of asynchronous counters with the extended glider-eater machine. Since the counter can be understood as a part of the Minsky register machine with only the INC (increment) function implemented, we envisage that the extended glider-eater machine could be essential if one intends to build a complete Minsky register machine in the Spiral Rule and to prove the rule is Turing-universal.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamatzky, A. (ed.): Collision-Based Computing. Springer, London (2002)

    MATH  Google Scholar 

  2. Adamatzky, A., De Lacy Costello, B.: Binary collisions between wave-fragments in a sub-excitable Belousov–Zhabotinsky medium. Chaos, Solitons & Fractals 34(2), 307–315 (2006)

    Article  Google Scholar 

  3. Adamatzky, A., Wuensche, A.: Computing in spiral rule reaction-diffusion hexagonal cellular automaton. Complex Systems 16(4) (2007)

    Google Scholar 

  4. Adamatzky, A., Martinez, G., Zhang, L., Wuensche, A.: Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton. Mathematical and Computer Modeling (2010) (in Press)

    Google Scholar 

  5. Berlekamp, E.R., Conway, J.H., Guy, R.K.: What is Life? In: Winning Ways: For Your Mathematical Plays, Games in Particular, ch. 25, vol. 2, pp. 817–850. Academic Press, London (1982)

    Google Scholar 

  6. Chapman, P.: Life Universal Computer, http://www.igblan.free-online.co.uk/igblan/ca/index.html

  7. Cook, M.: Universality in Elementary Cellular Automata. Complex Systems 15(1), 1–40 (2004)

    MATH  MathSciNet  Google Scholar 

  8. De Lacy Costello, B., Adamatzky, A.: Experimental implementation of collision-based gates in Belousov–Zhabotinsky medium. Chaos, Solitons & Fractals 25(3), 535–544 (2005)

    Article  MATH  Google Scholar 

  9. De Lacy Costello, B., Toth, R., Stone, C., Adamatzky, A., Bull, L.: Implementation of glider guns in the light-sensitive Belousov-Zhabotinsky medium. Physical Review E 79(2), 026114 (2009)

    Article  Google Scholar 

  10. Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theor. Phys. 21(3-4), 219–253 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gardner, M.: The fantastic combinations of John Conway’s new solitaire game “life”. Scientific American 223, 120–123 (1970)

    Article  Google Scholar 

  12. Margolus, N.: Physics-like models of computation. Physica D: Nonlinear Phenomena 10(1-2), 81–95 (1984)

    Article  MathSciNet  Google Scholar 

  13. Minsky, M.: Recursive Unsolvability of Post’s Problem of ‘Tag’ and Other Topics in Theory of Turing Machines. Annals of Math. 74, 437–455 (1961)

    Article  MathSciNet  Google Scholar 

  14. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Inc., Englewood Cliffs (1967)

    MATH  Google Scholar 

  15. Rendell, P.: Turing Universality of the Game of Life. In: Adamatzky, A. (ed.) Collision-Based Computing, pp. 513–539. Springer, London (2002)

    Google Scholar 

  16. Toth, R., Stone, C., Adamatzky, A., De Lacy Costello, B., Bull, L.: Experimental validation of binary collisions between wave fragments in the photosensitive Belousov–Zhabotinsky reaction. Chaos, Solitons & Fractals 41(4), 1605–1615 (2009)

    Article  Google Scholar 

  17. Toth, R., Stone, C., De Lacy Costello, B., Adamatzky, A., Bull, L.: Simple Collision-Based Chemical Logic Gates with Adaptive Computing. Int. J. Nanotechnology and Molecular Computation 1(3), 1–16 (2009)

    Google Scholar 

  18. Wolfram, S.: Universality and Complexity in Cellular Automata. Physica D: Nonlinear Phenomena 10(1-2), 1–35 (1984)

    Article  MathSciNet  Google Scholar 

  19. Wuensche, A., Adamatzky, A.: On spiral glider-guns in hexagonal cellular automata: Activator-inhibitor paradigm. Int. J. of Modern Physics C 17(7), 1009–1026 (2006)

    Article  MATH  Google Scholar 

  20. Wuensche, A.: Discrete Dynamics Lab (DDLab), http://www.cogs.susx.ac.uk/users/andywu/multi_value/spiral_rule.html

  21. Zhang, L., Adamatzky, A.: Collision-based implementation of a two-bit adder in excitable cellular automaton. Chaos, Solitons & Fractals 41(3), 1191–1200 (2009)

    Article  MathSciNet  Google Scholar 

  22. Zhang, L., Adamatzky, A.: Towards arithmetical chips in sub-excitable media: Cellular automaton models. Int. J. Nanotechnology and Molecular Computation 1(3), 63–81 (2009)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Center of Unconventional Computing, and Department of Computer Science, University of the West of England, Bristol

    Liang Zhang

Authors
  1. Liang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Auckland, Science Centre, 38 Princes Street, 1142, Auckland, New Zealand

    Cristian S. Calude

  2. Graduate School of Information Science and Technology, Department of Computer Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113-8656, Tokyo, Japan

    Masami Hagiya

  3. Graduate School of Engineering, Department of Information Engineering, Hiroshima University, 739-8527, Higashi-Hiroshima, Japan

    Kenichi Morita

  4. Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Department of Computer Science and Department of Electronics, University of York, YO10 5DD, Heslington, York, UK

    Jon Timmis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, L. (2010). The Extended Glider-Eater Machine in the Spiral Rule. In: Calude, C.S., Hagiya, M., Morita, K., Rozenberg, G., Timmis, J. (eds) Unconventional Computation. UC 2010. Lecture Notes in Computer Science, vol 6079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13523-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13523-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13522-4

  • Online ISBN: 978-3-642-13523-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation