Burks, A. Cellular Automata. University of Illinois Press, 1970, ch. Von Neumann's SelfReproducing Automata, pp. 3--64.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....dimensional models. One dimensional cellular automata have been extensively studied in the past and generated lots of interesting results [26, 27] Two dimensional cellular automata have also been studied a lot, and are the primary research vehicle for self replication studies in artificial life [3, 15, 5, 19]. Trend was designed to support two dimensional cellular automata programming, thus we focus mainly on 2 D cellular automata models in this article, although 1 D cellular automata can also be simulated with Trend. Each cell in a cellular automata space can be in one of # possible states specified ....

....of cellular automata had to be conducted analytically, as John von Neumann did with his 29 state self reproducing universal cellular automata machine [24] Later, when E.F. Codd constructed his 8 state self reproducing universal machine, he had started using computers to work out some of his rules [8, 3]. It had been necessary in the past for someone interested in studying cellular automata to develop his own program for simulation. That was usually a time consuming process even for simple models. The transition function was usually represented in a tabular format, as in von Neumann s and Codd s ....

[Article contains additional citation context not shown here]

Arthur W. Burks. Von Neumann's self-reproducing automata. In Arthur W. Burks, editor, Essays on Cellular Automata, pages 3--64. University of Illinois Press, Urbana, Illinois, 1970.

.... been invented by von Neumann in the late 1940s, the cellular automata approach has been applied to a large range of scientific problems (see for instance [1 14] The original motivation of von Neumann was to extract the abstract mechanisms leading to self reproduction of the biological organisms[15]. In other words the problem is to devise a system having the capability (and the recipe) to produce another organism of equivalent complexity with only its own ressource. Following the suggestions of S. Ulam[16] von Neumann addressed this question in the framework of a fully discrete universe ....

A.W. Burks. Von neumann's self-reproducing automata. In A.W. Burks, editor, Essays on Cellular Automata, pages 3--64. University of Illinois Press, 1970.

....biological 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 ....

A. W. Burks. Von Neumann's self-reproducing automata. In A. W. Burks, editor, Essays on Cellular Automata. Univerity of Illinois Press, Urbana, IL, 1970.

....Modelling morphogenesis, abstract description of biological cellular structures, implementation of parallel replacement systems. 1 Extended abstract The theory of cellular hypergraphs with parallel replacement systems combines the advantages from several other approaches: Cellular automata [1] are an inherently massive parallel paradigm that can be used to study effects of self organisation in complex systems. But because of their regular and fixed underlying grid, they can hardly be applied to questions from morphogenesis where cell proliferation and cell migration play a major role. ....

Burks. Von Neumann's Self-Reproducing Automata. In Essays on Cellular Automata, ed. Arthur W. Burks. University of Illinois Press, Urbana, Chicago, London, 1970.

....parents, and to improve their performance through evolution from a primordial ooze of primitive computational elements. The computational elements are a computationally complete set and compositions of them are capable of agglomerating themselves to one another. 1. Introduction John von Neumann (Burks 1987), E. F. Codd (1968) Thatcher (1970) John Devore (Devore and Hightower 1992) Christopher Langton (1983) Thomas Ray (1991a, 1991b, 1991c, 1991d) Skipper (1992) Rasmussen et al. 1990, 1991) and others have designed various selfreproducing automata and computer programs. Each of these ....

....that is more complex than that which it synthesizes. The machine tool is an organization which synthesizes something [that is] necessarily more complicated . than the organization it synthesizes, so that complication, or [re]productive potentiality in an organization, is degenerative (Burks 1987). Von Neumann also recognized that living organisms, unlike the machine tool, can produce things as complicated as themselves (by means of reproduction) and can produce things more complicated than themselves (by means of evolution) Von Neumann concluded there is a minimum number of parts ....

[Article contains additional citation context not shown here]

Burks, Arthur W. Von Neumann's self-reproducing automata. In Aspray, William and Burks, Arthur (editors). Papers of John von Neumann on Computing and Computer Theory. Cambridge, MA: The MIT Press 1987. Pages 491-552.

....In the following several sections, the attempts so far conducted to embody artificial organisms on CA are roughly reviewed in chronological order. 3.4. 1 Creating a universal constructor computer The first study of creating an artificial organism on a CA space was conducted by von Neumann in 1950 s[7, 58]. He devised CA, with Ulam s help, for the mathematical formulation of self reproduction of organisms. The basic composition of his self reproducing automaton[59] can be summarized as follows (see also Fig. 3.1) 1. Universal constructor A can construct another automaton according to instruction ....

....as shown in Figure 3.2. 4 Its counterpart is trivial self replication, represented by the example of the XOR rule introduced in section 2.3. Figure 3.2: Von Neumann s self reproducing automaton implemented on a 29 state 5 neighbor CA space. Left: The illustration of von Neumann s idea (from [7]) The box indicated as con struction control tape control corresponds to automaton D, and the tape drawn at the lower right part of the figure corresponds to instruction tape I D , in Figure 3.1. This automaton reproduces another automaton (the upper right part of the figure) according to ....

Burks, A. W. : Von Neumann's self-reproducing automata, in Burks, A. W. ed., Essays on Cellular Automata, pp. 3--64, University of Illinois Press, Urbana, Illinois (1970).

....both for the high speed simulation of scientific 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 collections of papers in all these areas, see, e.g. Burks (1970a) Fogelman Soulie, Robert, and Tchuente (1987) Farmer, Toffoli, and Wolfram (1984) Forrest (1990) Gutowitz (1990) Jesshope, Jossifov, and Wilhelmi (1994) and Wolfram (1986) In this chapter I will review selected topics related to computation in CAs. The presentation will assume an ....

....to be able to reproduce (a) b) Figure 3: a) The von Neumann neighborhood. b) The Moore neighborhood. In both cases, the cell to be updated is shaded. itself The idea of using cellular automata as a framework for answering this question was suggested to von Neumann by Stanislaw Ulam (Burks, 1970b) Thus, the original concept of cellular automata can be credited to Ulam, while early development of the concept can be credited to von Neumann. Von Neumann strongly believed that a general theory of computation in complex networks of automata such as cellular automata would be essential both ....

[Article contains additional citation context not shown here]

Burks, A. W. (1970c). Von Neumann's self-reproducing automata. In Burks (1970a).

....explicitly exists in the configuration 1 The terms reproduction and replication are often used in confusing way. The difference between them were discussed by Sipper et al. 18, 19] In this note, we obey the terminology used in each original article. 2 This work was completed by Burks [2]. 3 Von Neumann s automaton was realized later by Pesavento [13] Figure 1: Von Neumann s universal constructor. Left: The illustration of von Neumann s idea. from [23] Right: Its detailed configuration realized by Pesavento. from [13] Figure 2: Von Neumann s self reproducing automata. ....

A. W. Burks. Von Neumann's self-reproducing automata. In W. Aspray and A. W. Burks, editors, Papers of John von Neumann on Computing and Computer Theory, pages 491--552. MIT Press, Cambridge, Massachusetts, 1987.

No context found.

Burks, A. Cellular Automata. University of Illinois Press, 1970, ch. Von Neumann's SelfReproducing Automata, pp. 3--64.

No context found.

A. W. Burks, "Von Neumann's self-reproducing automata," in Essays on Cellular Automata, A. W. Burks, Ed. Champaign, IL: Univ. Illinois Press, 1970, pp. 3--74.

No context found.

A. W. Burks, "Von Neumann's self-reproducing automata," in Essays on Cellular Automata, A. W. Burks, Ed. Champaign, IL: Univ. Illinois Press, 1970, pp. 3--74.

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