Article
THEORY OF COMPUTING SYSTEMS  (1997)

Reaction-diffusion automata: Three states implies universality

Goles, E.; Matamala M.

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

Más información

Título de la Revista: THEORY OF COMPUTING SYSTEMS
Volumen: 30
Número: 3
Editorial: Springer
Fecha de publicación: 1997
Página de inicio: 223
Página final: 229
URL: http://www.scopus.com/inward/record.url?eid=2-s2.0-0038875723&partnerID=q2rCbXpz