In this paper we study the class of reaction-diffusion automaton with
three states (3-RDA). Namely, we prove that the dynamical behavior of
a given neural network can be simulated by a 3-RDA. Since arbitrary ne
ural networks may simulate Turing machines, the class of all 3-RDA is
universal.