@martin it's the simplest cellular automata definition, where each cell can have either one of two states (1 or 0) depending on the neighboring cells in previous state. Called Rule 30 because of the way Wolfram classified this stuff. Found this code here https://web.archive.org/web/20150812045749/http://kayladnls.com:80/2014/12/10/turing-complete-christma-tree/ recently, though I've been fascinated by cellular automata for a while.
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!