Codd's Cellular Automaton is a cellular automaton devised by the British computer scientist Edgar F. Codd in 1968. A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, and theoretical biology. ... Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: ‪Wikipedia articles needing priority cleanup‬ | ‪Computer science‬ ... Edgar Ted Codd Edgar F. Ted Codd (August 23, 1923 – April 18, 2003) was a British computer scientist who made seminal contributions to the theory of relational databases. ... 1968 (MCMLXVIII) was a leap year starting on Monday (the link is to a full 1968 calendar). ...

Description

John von Neumann found and handled the problem John von Neumann in the 1940s. ...

What kind of logical organization is sufficient for an automaton to be able to reproduce itself?

He was able to construct a Universal Constructor with a square grid and 29 states. E. F. Codd found a simpler machine with only eight states. Therefore von Neumanns question had to be modified: The Nobili-Pesavento 29-state approximation of von Neumanns universal constructor, with a tape of instructions extending to the right. ...

What kind of logical organization is necessary for an automaton to be able to reproduce itself?

Codd's Cellular Automaton is a 8-state, 5-neighbors cellular automaton. Its main concept is based on (1-)paths on the empty (0-)field. These paths are wires for signals consisting of one of the numbers 4 to 7 followed by 0 to define the direction of transmission. To prevent signals from flooding into the 0-space, every path is sheathed by a line of 2-states on each side.

Implementation

Christopher G. Langton presented another simplification of Codd's Cellular Automaton in 1984 which shows reproductive behaviour. It shows the reproduction of a "complex" cell loop and has been implemented as a Java applet using Eclipse. This page is about the year 1984. ... A Java applet is an applet written in the Java programming language. ...

References

• E. F. Codd, Cellular Automata (Academic Press, New York, 1968)
• Christopher G. Langton, Self-Reproduction in Cellular Automata, Physica 10D (1984)
• A. W. Burks, ed. Essays on Cellular Automata, Univ of Illinois 1968
• J. v. Neumann, The theory of self Reproducing Automata. A. W. Burks, ed. (Univ. of Illinous Press. Illinois 1966)

1968 (MCMLXVIII) was a leap year starting on Monday (the link is to a full 1968 calendar). ... This page is about the year 1984. ... 1968 (MCMLXVIII) was a leap year starting on Monday (the link is to a full 1968 calendar). ... 1966 was a common year starting on Saturday (link goes to calendar) // Events January January 1 - In a coup, Colonel Jean-Bédel Bokassa ousts president David Dacko and takes over the Central African Republic. ...

External links

• View the simple version.
• View the advanced version.
• Get the source.

Due to compatibility reasons you may have problems displaying the applet. Another link is provided in that case. Microsoft users should try:

• View the simple version.
• View the advanced version.