REACTION-DIFFUSION AUTOMATA - 3 STATES IMPLIES UNIVERSALITY

Authors
GOLES E MATAMALA M
Citation
E. Goles et M. Matamala, REACTION-DIFFUSION AUTOMATA - 3 STATES IMPLIES UNIVERSALITY, theory of computing systems, 30(3), 1997, pp. 223-229
Citations number
7
Categorie Soggetti
System Science",Mathematics,"Computer Science Theory & Methods",Mathematics
Journal title
theory of computing systems → ACNP
Volume
30
Issue
3
Year of publication
1997
Pages
223 - 229
Database
ISI
SICI code
Abstract
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.