A borderless implementation of Rule 110
-
Updated
Apr 15, 2020 - Python
A borderless implementation of Rule 110
Unidimensional Cellular Automata Explorer managing _arbitrary rules_
A Rule 110 simulation written as an ed(1) script.
Rule110 Cellular Automata ASIC for Tiny Tapeout 05
A super powerful Typescript library for cellular automation
An implementation of the Turing-complete Rule 110 monodimensional cellular automaton in HTML5 canvas
A cellular automaton (CA) explorer to understand and unveil properties of CA in 1D.
Ruby implementation for different cellular automata
Rule 110 implementation in C programming language.
An elementary cellular automaton with interesting behaviour on the boundary between stability and chaos.
A simple program to demonstrate the universality of a general-purpose LLM
Visualise any possible elementary cellular automaton, where N is the Wolfram code
Emulator that uses the power of OpenGL to breed digital life forms.
Visualization of Rule 110 and other elementary cellular automata of this type.
This is my practice code wich generate patter of symbols in console of size 80x80 according to "Rule 110" cellular automata. Fist line generated pseudo-randomly, and every next line is based on previous.
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."