Skip to main content
SpringerLink
Log in

On the Persistency of Gellular Automata

  • Chapter
  • First Online:
Reversibility and Universality

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 30))

Abstract

Gellular automata have been proposed as a new model of cellular automata that are intended to be implemented with gel materials. Computational universality has been investigated and has been shown with unidirectional signal propagation through Moritas rotary elements. A way to realize a Margolus neighborhood has also been proposed, so that block cellular automata can be realized directly in the model. In this chapter, the persistency of those results is examined with numerical simulations. It is shown that block cellular automata can undergo an infinite number of state transitions, and unidirectional signals can be transmitted repeatedly over a circuit. To show persistency, slight modifications of the proposed reactions are needed.

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 EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Hagiya, M., Wang, S., Kawamata, I., Murata, S., Isokawa, T., Peper, F., Imai, K.: On DNA-based gellular automata. In: Unconventional Computation and Natural Computation, 13th International Conference, UCNC 2014. Lecture Notes in Computer Science, vol. 8553, pp. 177–18 (2014). https://doi.org/10.1007/978-3-319-08123-6_15

  2. Hagiya, M., Konagaya, A., Kobayashi, S., Saito, H., Murata, S.: Molecular robots with sensors and intelligence. Acc. Chem. Res. ACS 47(6), 1681–1690 (2014). https://doi.org/10.1021/ar400318d

    Article  Google Scholar 

  3. Isokawa, T., Peper, F., Kawamata, I., Matsui, N., Murata, S., Hagiya, M.: Universal totalistic asynchronous cellular automaton and its possible implementation by DNA. In: Unconventional Computation and Natural Computation, 15th International Conference, UCNC 2016. Lecture Notes in Computer Science, vol. 9726, pp. 182–195 (2016). https://doi.org/10.1007/978-3-319-41312-9_15

  4. Kawamata, I., Yoshizawa, S., Takabatake, F., Sugawara, K., Murata, S.: Discrete DNA reaction-diffusion model for implementing simple cellular automaton. In: Unconventional Computation and Natural Computation, 15th International Conference, UCNC 2016. Lecture Notes in Computer Science, vol. 9726, pp. 168–181 (2016)

    Google Scholar 

  5. Margolus, N.: Physics-like models of computation. Physica D 10, 81–95 (1984). https://doi.org/10.1016/0167-2789(84)90252-5

    Article  MathSciNet  MATH  Google Scholar 

  6. Morita, K.: A simple universal logic element and cellular automata for reversible computing. Machines, Computations, and Universality, MCU 2001. Lecture Notes in Computer Science, vol. 2055, pp. 102–113 (2001)

    Google Scholar 

  7. Murata, S., Konagaya, A., Kobayashi, S., Saito, H., Hagiya, M.: Molecular robotics: a new paradigm for artifacts. New Gener. Comput. 31, 27–45 (2013)

    Article  Google Scholar 

  8. Wang, S.: An approach to constructing and simulating block cellular automata by gellular automata. Master Thesis (2016)

    Google Scholar 

  9. Wang, S., Imai, K., Hagiya, M.: On the composition of signals in gellular automata. In: Second International Symposium on Computing and Networking (CANDAR-AFCA), pp. 499–502 (2014). https://doi.org/10.1109/CANDAR.2014.71

  10. Wang, S., Imai, K., Hagiya, M.: An approach to constructing and simulating block cellular automata by gellular automata. In: Third International Symposium on Computing and Networking (CANDAR-AFCA), pp. 442–448 (2015). https://doi.org/10.1109/CANDAR.2015.97

Download references

Acknowledgements

This research is supported by Grant-in-Aid for Scientific Research on Innovative Areas “Molecular Robotic” (No. 24104003 and No. 24104005) of The Ministry of Education, Culture, Sports, Science, and Technology, Japan.

Author information

Authors and Affiliations

  1. University of Tokyo, Tokyo, Japan

    Masami Hagiya

  2. Hiroshima University, Higashihiroshima, Japan

    Katsunobu Imai

Authors
  1. Masami Hagiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsunobu Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masami Hagiya .

Editor information

Editors and Affiliations

  1. Unconventional Computing Centre, University of the West of England, Bristol, United Kingdom

    Andrew Adamatzky

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hagiya, M., Imai, K. (2018). On the Persistency of Gellular Automata. In: Adamatzky, A. (eds) Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer, Cham. https://doi.org/10.1007/978-3-319-73216-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73216-9_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73215-2

  • Online ISBN: 978-3-319-73216-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation