Reaction-diffusion automata: Three states implies universality

E. Goles; M. Matamala

doi:10.1007/BF02679460

Reaction-diffusion automata: Three states implies universality

E. Goles
, M. Matamala

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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.

Original language	English
Pages (from-to)	223-229
Number of pages	7
Journal	Theory of Computing Systems
Volume	30
Issue number	3
DOIs	https://doi.org/10.1007/BF02679460
State	Published - 1997
Externally published	Yes

Access to Document

10.1007/BF02679460

Cite this

@article{94d9d0cdbdbd429c9a22373df0ec4530,

title = "Reaction-diffusion automata: Three states implies universality",

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.",

author = "E. Goles and M. Matamala",

note = "Funding Information: * This work was partially supported by FONDECYT 1950569 (M.M.), 1940520 (E.G.), under Grant CEE Marie Curie (M.M.), ECOS-94 (M.M. and E.G.), and DTI - U. Chile (E.G.).",

year = "1997",

doi = "10.1007/BF02679460",

language = "English",

volume = "30",

pages = "223--229",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Reaction-diffusion automata

T2 - Three states implies universality

AU - Goles, E.

AU - Matamala, M.

N1 - Funding Information: * This work was partially supported by FONDECYT 1950569 (M.M.), 1940520 (E.G.), under Grant CEE Marie Curie (M.M.), ECOS-94 (M.M. and E.G.), and DTI - U. Chile (E.G.).

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0038875723

U2 - 10.1007/BF02679460

DO - 10.1007/BF02679460

M3 - Article

AN - SCOPUS:0038875723

SN - 1432-4350

VL - 30

SP - 223

EP - 229

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 3

ER -

Reaction-diffusion automata: Three states implies universality

Abstract

Access to Document

Fingerprint

Cite this