Resumen
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.
Idioma original | Inglés |
---|---|
Páginas (desde-hasta) | 223-229 |
Número de páginas | 7 |
Publicación | Theory of Computing Systems |
Volumen | 30 |
N.º | 3 |
DOI | |
Estado | Publicada - 1997 |
Publicado de forma externa | Sí |