|
Article on other languages:
|
2 Wireworld diodes, the above one in conduction direction, the lower one in reverse-biasing
Wireworld is a well-known cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more widely known as a result of an article in the "Computer Recreations" column of Scientific American.[1] Wireworld is particularly suited to simulating electronic logic elements, or "gates", and, despite the simplicity of the rules, Wireworld is Turing-complete[citation needed].
RulesA Wireworld cell can be in one of four different states:
Note that in software these states are often numbered 0-3 rather than 1-4. In the examples on this page, the states are displayed as colours proceeding: black, blue, red, yellow. These colours are in no way standardized. Like in all cellular automata time proceeds in discrete steps called generations (sometimes "gens" for short). Cells behave as follows:
Wireworld has what is called the Moore neighborhood, which means that in the rules above, neighbouring means one cell away (range value of one) in any direction (orthogonal and diagonal). Using just these simple rules we can begin to construct gates (see below). ApplicationsNotable entities built within Wireworld universes include a computer which tests odd positive integers (and 2) for primeness[2], and unit cells for another cellular automaton; Langton's Ant (allowing any Langton's Ant pattern to be built within Wireworld).[3] Computer programs featuring Wireworld
See alsoReferences
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.
Mercedes Car
This site monitored by SitePinger.net