|
Wireworld is a 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''.〔Computer recreations: The cellular automata programs that create Wireworld, Rugworld and other diversions, Scientific American (1990) by A K Dewdney〕 Wireworld is particularly suited to simulating electronic logic elements, or "gates", and, despite the simplicity of the rules, Wireworld is Turing-complete. ==Rules== A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here:
As in all cellular automata, time proceeds in discrete steps called generations (sometimes "gens" or "ticks"). Cells behave as follows: * Empty → Empty * Electron head → Electron tail * Electron tail → Conductor * Conductor → Electron head if exactly one or two of the neighbouring cells are electron heads, or remains Conductor otherwise. Wireworld uses 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, both orthogonal and diagonal. These simple rules can be used to construct logic gates (see below). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Wireworld」の詳細全文を読む スポンサード リンク
|