A simple Wireworld cellular automaton explorer in Swift
Wireworld is a cellular automaton first proposed by Brian Silverman in 1987. Wireworld is particularly suited to simulating electronic logic elements, or "gates", and, despite the simplicity of the rules, Wireworld is Turing-complete.
Cells have four possible states, which evolve as follows:
- empty -> empty
- head -> tail
- tail -> wire
- wire -> if 1 or 2 heads among neighbours then head, else wire
Wireworld can be used to build logic gates and, from there, The Wireworld computer.
Download: wireworld_0_2.zip (3.4 MB)
