Continuous spatial automaton: Difference between revisions

Revision as of 22:43, 5 December 2019

Revision as of 16:29, 9 February 2020

Line 4:

MacLennan [http://www.cs.utk.edu/~mclennan/contin-comp.html] considers continuous spatial automata as a model of computation, and demonstrated that they can implement Turing-universality.<ref>David H. Wolpert and Bruce J. MacLennan, [http://web.eecs.utk.edu/~mclennan/papers/ut-cs-93-206.pdf "!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. </ref>

==References==

{{Reflist}}

==See also==

*[[Analog computer]]

*[[Coupled map lattice]]

==References==

{{Reflist}}

[[Category:Cellular automata]]