Reaction-diffusion automata: Three states implies universality

E. Goles, M. Matamala

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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 neural networks may simulate Turing machines, the class of all 3-RDA is universal.

Original languageEnglish
Pages (from-to)223-229
Number of pages7
JournalTheory of Computing Systems
Issue number3
StatePublished - 1997
Externally publishedYes


Dive into the research topics of 'Reaction-diffusion automata: Three states implies universality'. Together they form a unique fingerprint.

Cite this