Turing-Completeness of Asynchronous Non-camouflage Cellular Automata

  • Tatsuya YamashitaEmail author
  • Teijiro Isokawa
  • Ferdinand Peper
  • Ibuki Kawamata
  • Masami Hagiya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10248)


Asynchronous Boolean totalistic cellular automata have recently attracted attention as promising models for the implementation of reaction-diffusion systems. It is unknown, however, to what extent they are able to conduct computation. In this paper, we introduce the so-called non-camouflage property, which means that a cell’s update is insensitive to neighboring states that equal its own state. This property is stronger than the Boolean totalistic property, which signifies the existence of states in a cell’s neighborhood, but is not concerned with how many cells are in those states. We argue that the non-camouflage property is extremely useful for the implementation of reaction-diffusion systems, and we construct an asynchronous cellular automaton with this property that is Turing-complete. This indicates the feasibility of computation by reaction-diffusion systems.


Cellular Automaton Neighboring Cell Turing Machine Cell State Transition Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



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


  1. 1.
    Hagiya, M., Wang, S., Kawamata, I., Murata, S., Isokawa, T., Peper, F., Imai, K.: On DNA-based gellular automata. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 177–189. Springer, Cham (2014). doi: 10.1007/978-3-319-08123-6_15 Google Scholar
  2. 2.
    Isokawa, T., Peper, F., Kawamata, I., Matsui, N., Murata, S., Hagiya, M.: Universal totalistic asynchonous cellular automaton and its possible implementation by DNA. In: Amos, M., Condon, A. (eds.) UCNC 2016. LNCS, vol. 9726, pp. 182–195. Springer, Cham (2016). doi: 10.1007/978-3-319-41312-9_15 Google Scholar
  3. 3.
    Kawamata, I., Hosoya, T., Takabatake, F., Sugawara, K., Nomura, S., Isokawa, T., Peper, F., Hagiya, M., Murata, S.: Pattern formation and computation by autonomous chemical reaction diffusion model inspired by cellular automata. In: 2016 Fourth International Symposium on Computing and Networking (CANDAR), pp. 215–221. IEEE (2016)Google Scholar
  4. 4.
    Morita, K.: A simple universal logic element and cellular automata for reversible computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 102–113. Springer, Heidelberg (2001). doi: 10.1007/3-540-45132-3_6 CrossRefGoogle Scholar
  5. 5.
    Priese, L.: Automata and concurrency. Theor. Comput. Sci. 25(3), 221–265 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Wang, S., Imai, K., Hagiya, M.: On the composition of signals in gellular automata. In: 2014 Second International Symposium on Computing and Networking (CANDAR), pp. 499–502. IEEE (2014)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  • Tatsuya Yamashita
    • 1
    Email author
  • Teijiro Isokawa
    • 2
  • Ferdinand Peper
    • 3
  • Ibuki Kawamata
    • 4
  • Masami Hagiya
    • 1
  1. 1.University of TokyoTokyoJapan
  2. 2.University of HyogoKobeJapan
  3. 3.NICT and Osaka UniversityOsakaJapan
  4. 4.Tohoku UniversitySendaiJapan

Personalised recommendations