Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/s002240000051 | Theory Comput. Syst. |
Keywords | Field | DocType |
Neural Network,Forest Fire,Turing Machine,Discrete Dynamical System,Logical Calculus | Statistical physics,Quantum Turing machine,Discrete mathematics,Two-way deterministic finite automaton,Mobile automaton,Universal Turing machine,Super-recursive algorithm,Theoretical computer science,Turing machine,Time hierarchy theorem,Cellular neural network,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | 1432-4350 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eric Goles Ch. | 1 | 56 | 15.72 |
| Martín Matamala | 2 | 158 | 21.63 |