Reaction-diffusion automata: Three states implies universality
- 50 Downloads
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.
KeywordsNeural Network Forest Fire Turing Machine Discrete Dynamical System Logical Calculus
Unable to display preview. Download preview PDF.
- P. Grassberger and H. Kantz. On a Forest Fire Model with Supposed Self-Organized Criticality. Preprint, Phys. Dept., Univ. Wuppertal, 1990.Google Scholar