Jump to content

Continuous spatial automaton

From Wikipedia, the free encyclopedia

A continuous spatial automaton is a type of computer model studied in automata theory, a subfield of computer science. It is similar to a cellular automaton, in that it models the evolution of a set of many states over time. Unlike a cellular automaton, which has a discrete grid of states, a continuous spatial automaton has a continuum of locations in one or more dimensions. The state at each location may be chosen from a discrete set of numbers, or from a continuous interval of real numbers. The states may also vary continuously in time, and in this case the state evolves according to a differential equation.

One important example is reaction–diffusion textures, differential equations proposed by Alan Turing to explain how chemical reactions could create the stripes on zebras and spots on leopards. When these are approximated by cellular automata, such cellular automata often yield similar patterns. Another important example is neural fields, which are the continuum limit of neural networks where average firing rates evolve based on integro-differential equations.[1][2] Such models demonstrate spatiotemporal pattern formation, localized states and travelling waves.[3][4] They have been used as models for cortical memory states and visual hallucinations.[5]

Bruce MacLennan considers continuous spatial automata as a model of computation, and demonstrated that they can implement Turing-universality.[6]

See also

[edit]

References

[edit]
  1. ^ H. R. Wilson and J. D. Cowan. "Excitatory and inhibitory interactions in localized populations of model neurons" Biophysical Journal, 12:1–24, 1972.
  2. ^ H. R. Wilson and J. D. Cowan. "A mathematical theory of the functional dynamics of cortical and thalamic nervous tissue" Kybernetik, 13:55–80, 1973.
  3. ^ S. Amari. "Dynamics of pattern formation in lateral inhibition type neural fields" Biological Cybernetics, 27:77–87, 1977.
  4. ^ Coombes, Stephen (2006). "Neural fields" (PDF). Scholarpedia. 1 (6): 1373. Bibcode:2006SchpJ...1.1373C. doi:10.4249/scholarpedia.1373.
  5. ^ G. B. Ermentrout and J. D. Cowan. "A mathematical theory of visual hallucination patterns" Biological Cybernetics, 34:137–150, 1979.
  6. ^ David H. Wolpert and Bruce J. MacLennan, "A Universal Field Computer That is Purely Linear", University of Tennessee, Knoxville, Department of Computer Science Technical Report CS-93-206, September 14, 1993, 28 pp.