Computing by Swarm Networks

  • Authors:

  • Teijiro Isokawa;Ferdinand Peper;Masahiko Mitsui;Jian-Qin Liu;Kenichi Morita;Hiroshi Umeo;Naotake Kamiura;Nobuyuki Matsui

  • Affiliations:

  • Division of Computer Engineering, University of Hyogo, Japan;Division of Computer Engineering, University of Hyogo, Japan and Nano ICT Group, National Institute of Information and Communications Technology, Japan;Division of Computer Engineering, University of Hyogo, Japan;Biological ICT Group, National Institute of Information and Communications Technology, Japan;Dept. of Information Engineering, Hiroshima University, Japan;Dept. of Computer Science, Osaka Electro-Communication University, Japan;Division of Computer Engineering, University of Hyogo, Japan;Division of Computer Engineering, University of Hyogo, Japan

  • Venue:
  • ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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