A Rule 110 simulation written as an ed(1) script.
-
Updated
Jan 28, 2019 - Makefile
A Rule 110 simulation written as an ed(1) script.
A borderless implementation of Rule 110
Unidimensional Cellular Automata Explorer managing _arbitrary rules_
A super powerful Typescript library for cellular automation
A cellular automaton (CA) explorer to understand and unveil properties of CA in 1D.
Rule110 Cellular Automata ASIC for Tiny Tapeout 05
Ruby implementation for different cellular automata
Emulator that uses the power of OpenGL to breed digital life forms.
An elementary cellular automaton with interesting behaviour on the boundary between stability and chaos.
Visualise any possible elementary cellular automaton, where N is the Wolfram code
Implementation of elementary cellular automation in rust wasm
Add a description, image, and links to the rule110 topic page so that developers can more easily learn about it.
To associate your repository with the rule110 topic, visit your repo's landing page and select "manage topics."