Computing by Swarm Networks
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.
KeywordsCellular Automaton Cellular Automaton Transition Rule Cellular Automaton Model Output Wire
Unable to display preview. Download preview PDF.
- 1.Turing, A.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. 2(42), 230–265 (1936)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
- 13.Bayindir, L., Sahin, E.: A review of studies in swarm robotics. Turk J. Elec. Engin. 15(2), 115–147 (2007)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