Skip to main content

On a Universal Brownian Cellular Automata with 3 States and 2 Rules

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2016)

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

Included in the following conference series:

Abstract

This paper presents a 3-state asynchronous CA that requires merely two transition rules to achieve computational universality. This universality is achieved by embedding Priese’s delay-insensitive circuit elements, called the E-element and the K-element, on the cell space of a so-called Brownian CA, which is an asynchronous CA containing local configurations that conduct a random walk in the circuit topology.

K. Ono has been with Glory Limited, Japan, since 2011.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Biafore, M.: Cellular automata for nanometer-scale computation. Physica D 70, 415–433 (1994)

    Article  MATH  Google Scholar 

  2. Durbeck, L.J.K., Macias, N.J.: The cell matrix: an architecture for nanocomputing. Nanotechnology 12, 217–230 (2001)

    Article  Google Scholar 

  3. Peper, F., Lee, J., Adachi, S., Mashiko, S.: Laying out circuits on asynchronous cellular arrays: a step towards feasible nanocomputers? Nanotechnology 14, 469–485 (2003)

    Article  Google Scholar 

  4. Peper, F., Lee, J., Isokawa, T.: Cellular nanocomputers: a focused review. Int. J. Nanotechnol. Mol. Comput. 1, 33–49 (2009)

    Article  Google Scholar 

  5. Kish, L.B.: Thermal noise driven computing. Appl. Phys. Lett. 89(14), 144104 (2006)

    Article  Google Scholar 

  6. Dasmahapatra, S., Werner, J., Zauner, K.P.: Noise as a computational resource. Int. J. Unconventional Comput. 2(4), 305–319 (2006)

    Google Scholar 

  7. Yanagida, T., Ueda, M., Murata, T., Esaki, S., Ishii, Y.: Brownian motion, fluctuation and life. Biosystems 88(3), 228–242 (2007)

    Article  Google Scholar 

  8. Lee, J., Peper, F.: Efficient computation in brownian cellular automata. In: Peper, F., Umeo, H., Matsui, N., Isokawa, T. (eds.) Proceedings of 4th International Workshop on Natural Computing, vol. 2, pp. 47–56. Springer, Tokyo (2009)

    Google Scholar 

  9. Peper, F., Lee, J., Carmona, J., Cortadella, J., Morita, K.: Brownian circuits: fundamentals. ACM J. Emerg. Technol. Comput. Syst. 9(1), 1–24 (2013). Article no. 3

    Article  Google Scholar 

  10. Priese, L.: Automata and concurrency. Theoret. Comput. Sci. 25(3), 221–265 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

This work was supported by a Grant-in-Aid for Scientific Research on Innovative Areas “Molecular Robotics” (No. 15H00825) of The Ministry of Education, Culture, Sports, Science, and Technology, Japan.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Teijiro Isokawa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Isokawa, T., Peper, F., Ono, K., Matsui, N. (2016). On a Universal Brownian Cellular Automata with 3 States and 2 Rules. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44365-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44364-5

  • Online ISBN: 978-3-319-44365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics