TY - GEN
T1 - Turing-completeness of asynchronous non-camouflage cellular automata
AU - Yamashita, Tatsuya
AU - Isokawa, Teijiro
AU - Peper, Ferdinand
AU - Kawamata, Ibuki
AU - Hagiya, Masami
N1 - Publisher Copyright:
© IFIP International Federation for Information Processing 2017.
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85020426435&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85020426435&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-58631-1_15
DO - 10.1007/978-3-319-58631-1_15
M3 - Conference contribution
AN - SCOPUS:85020426435
SN - 9783319586304
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 187
EP - 199
BT - Cellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Proceedings
A2 - Dennunzio, Alberto
A2 - Manzoni, Luca
A2 - Porreca, Antonio E.
A2 - Formenti, Enrico
PB - Springer Verlag
T2 - 23rd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2017
Y2 - 7 June 2017 through 9 June 2017
ER -