A Wireworld is a cellular automaton (like Conway's Game of Life) with four states:
- null
- wire
- electron head
- electron tail
These four states transition by the following rules:
- null -> null
- tail -> wire
- head -> tail
- wire -> head (iff exactly 1 or 2 neighbors are an electron head)
- wire -> wire (otherwise)
Wireworlds are Turing-complete and are interesting in that they can so closely mirror digital transistor behavior with such simple rules.
This is an implementation of a Wireworld and can be found at wireworld.klmntn.com.