Turing-completeness of asynchronous non-camouflage cellular automata

Tatsuya Yamashita, Teijiro Isokawa, Ferdinand Peper, Ibuki Kawamata, Masami Hagiya

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationCellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Proceedings
EditorsAlberto Dennunzio, Luca Manzoni, Antonio E. Porreca, Enrico Formenti
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783319586304
Publication statusPublished - 2017
Event23rd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2017 - Milan, Italy
Duration: 2017 Jun 72017 Jun 9

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10248 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference23rd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2017


Dive into the research topics of 'Turing-completeness of asynchronous non-camouflage cellular automata'. Together they form a unique fingerprint.

Cite this