| Mitchell, M. Nonstandard Computation. Weinheim, VCH Vetagsgesellschaft, 1998, ch. Computation in Cellular Automata: A Selected Review, pp. 95--140. |
....macrostructures in a single computational ecosystem. For other relevant work, we refer to the ecological models studied in [5 7] Cellular automata (CAs) are discrete dynamical systems of simple locally connected interacting cells [8 10] They are simple, general, and computationally powerful [11, 12]. The model is perhaps the simplest example of systems that are capable of emergent computation global information processing that appears in systems from the action of many interacting components [13, 14] The evolution of CAs that perform non trivial computation has been studied in [15, 16] ....
M. Mitchell. Computation in cellular automata: A selected review. In H. G. Schuster and T. Gramss, editors, Nonstandard Computation. VCH Verlagsgesellschaft, Weinheim, 1996.
....other intervals of excitation that behave as if belonging to classes W1 and W2. This again supports the case that, when dealing with automata models more complex than one dimensional automata, classification on the basis of the l parameter seems to be inadequate. This was discussed in detail in [40]. The activity dynamics of these media are shown in Fig. 4. What additional phenomena can be extracted from these results One obvious characteristic is the dependence of behaviour on the initial conditions. Thus a medium with excitation interval [ 28] does not appear to be affected by the ....
Mitchell M. Computation in cellular automata: a selected review. Santa Fe Institute Working Paper 9609 -074, 1996.
....both for the high speed simulation of scienti c models and for computational tasks such as image processing. In addition, CAs have been used as abstract models for studying emergent cooperative or collective behavior in complex systems. For discussions of work in all these areas, see, e.g. [4, 26, 30, 37, 46, 59, 44, 55, 71, 82]. 3. A Computational Task for Cellular Automata It has been shown that some CAs are capable of universal computation; see, e.g. 3, 50, 67] The constructions either embed a universal Turing machine s tape states, read write head location, and nite state control in a CA s con gurations and ....
M. Mitchell. Computation in cellular automata: A selected review. In T. Gramss, editor, Nonstandard Computation, Weinheim, 1998. VCH Verlagsgesellschaft.
....self reproduction were well understood, is testament to von Neumann s insight. Von Neumann s design and mathematical proofs of its correctness were eventually published in 1966 as a book, Theory of Self Reproducing Automata [28] completed and edited by his colleague Arthur Burks. See [4] and [25] for descriptions of von Neumann s self replicating automaton. See Chapter 16 of [14] for an account of self replication in DNA and how it relates to mathematical logic and self copying computer programs. Von Neumann s design for a self reproducing automaton was one of the rst real advances in ....
M. Mitchell. Computation in cellular automata: A selected review. In T. Gramss et al., editor, Nonstandard Computation. Wiley-VCH, Weinheim, Germany, 1998. Available at http://www.santafe.edu/ mm/paper-abstracts.html#ca-review.
No context found.
Mitchell, M. Nonstandard Computation. Weinheim, VCH Vetagsgesellschaft, 1998, ch. Computation in Cellular Automata: A Selected Review, pp. 95--140.
No context found.
M. Mitchell. Computation in cellular automata: A selected review. In T. Gramss et al., (ed.), Nonstandard Computation, pp. 95-140, Wiley-VCH, Weinheim,1998. Available at http: //www.cs.pdx.edu/
No context found.
#Mitchell M. Computation in cellular automata: a selected review. Santa Fe Institute Working Paper 96-09-074, 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC