Skip to main content

Computing by Swarm Networks

  • Conference paper
Cellular Automata (ACRI 2008)

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

Included in the following conference series:

Abstract

Though the regular and fixed structure of cellular automata greatly contributes to their simplicity, it imposes a strict limitation on the applications that can be modeled by them. This paper proposes swarm networks, a model in which cells, unlike in cellular automata, have irregular neighborhoods. Timed asynchronously, a cell in this model acts like an agent that can dynamically interact with a varying set of other cells under the control of transition rules. The configurations in which cells are organized according to their neighborhoods can move around in space, following simple mechanical laws. We prove computational universality of this model by simulating a circuit consisting of asynchronously timed circuit modules. The proposed model may find applications in nanorobotic systems and artifical biological systems.

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 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. Turing, A.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. 2(42), 230–265 (1936)

    Google Scholar 

  2. Church, A.: An unsolvable problem of elementary number theory. American Journal of Mathematics 58(2), 345–363 (1936)

    Article  MathSciNet  Google Scholar 

  3. Neumann, J.V.: Theory of Self-Reproducing Automata. University of Illinois Press, Champaign (1966)

    Google Scholar 

  4. Banks, E.: Universality in cellular automata. In: IEEE 11th Ann. Symp. on Switching and Automata Theory, pp. 194–215 (1970)

    Google Scholar 

  5. Codd, E.F.: Cellular Automata. Academic Press, Inc., Orlando (1968)

    MATH  Google Scholar 

  6. Serizawa, T.: Three-state Neumann neighbor cellular automata capable of constructing self-reproducing machines. Syst. and Comput. in Japan 18(4), 33–40 (1987)

    Article  Google Scholar 

  7. Adachi, S., Peper, F., Lee, J.: Computation by asynchronously updating cellular automata. Journal of Statistical Physics 114(1/2), 261–289 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lee, J., Adachi, S., Peper, F., Morita, K.: Embedding universal delay-insensitive circuits in asynchronous cellular spaces. Fundamenta Informaticae 58(3/4), 295–320 (2003)

    MATH  MathSciNet  Google Scholar 

  9. Lee, J., Adachi, S., Peper, F., Mashiko, S.: Delay-insensitive computation in asynchronous cellular automata. Journal of Computer and System Sciences 70(2), 201–220 (2005)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  11. Peper, F., Lee, J., Abo, F., Isokawa, T., Adachi, S., Matsui, N., Mashiko, S.: Fault-tolerance in nanocomputers: A cellular array approach. IEEE Trans. Nanotechnology 3(1), 187–201 (2004)

    Article  Google Scholar 

  12. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute Studies on the Sciences of Complexity. Oxford University Press, USA (1999)

    MATH  Google Scholar 

  13. Bayindir, L., Sahin, E.: A review of studies in swarm robotics. Turk J. Elec. Engin. 15(2), 115–147 (2007)

    Google Scholar 

  14. Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40(8), 102–114 (2002)

    Article  Google Scholar 

  15. ter Beek, M., Ellis, C., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Comput. Supported Coop. Work 12(1), 21–69 (2003)

    Article  Google Scholar 

  16. Stevens, W.: Simulating self-replicating machines. Journal of Intelligent and Robotic Systems 49(2), 135–150 (2007)

    Article  Google Scholar 

  17. Priese, L.: Automata and Concurrency. Theoretical Computer Science 25(3), 221–265 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  18. Krauss, G.: Biochemistry of signal transduction and regulation. Wiley-VCH, Weinheim (2008)

    Google Scholar 

  19. Liu, J.Q., Shimohara, K.: Biomolecular computation for bionanotechnology. Artech House, Boston (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hiroshi Umeo Shin Morishita Katsuhiro Nishinari Toshihiko Komatsuzaki Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Isokawa, T. et al. (2008). Computing by Swarm Networks. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79992-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79991-7

  • Online ISBN: 978-3-540-79992-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics