Asynchronous Boolean totalistic cellular automata have recently attracted attention as promising models for implementation by 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 subsumes 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 by directly simulating Turing machines. We also construct another asynchronous cellular automaton, but this model incorporates the so-called freezing property [1], which restricts the direction of transitions of each cell to one-way. We show that this model is Turing-complete, since it can simulate the temporal evolution of elementary cellular automata. These results indicate the feasibility of computation by reaction-diffusion systems.

异步布尔全能细胞自动机作为反应扩散系统的有前途的模型，最近引起了人们的关注。但是，他们在多大程度上能够进行计算仍是未知的。在本文中，我们介绍了所谓的非伪装属性，这意味着像元的更新对等于其自身状态的相邻状态不敏感。该属性包含布尔的全面属性，表示某个单元邻域中存在状态，但与这些状态中有多少个单元无关。我们认为非伪装属性对于实现反应扩散系统非常有用，并且我们通过直接模拟Turing机器来构建具有Turing-complete的此属性的异步蜂窝自动机。我们还构造了另一个异步细胞自动机，但是该模型包含了所谓的冻结属性[1]，该属性限制了每个单元格向单向过渡的方向。我们证明该模型是图灵完备的，因为它可以模拟基本细胞自动机的时间演变。这些结果表明通过反应扩散系统进行计算的可行性。