A borderless implementation of Rule 110
-
Updated
Apr 15, 2020 - Python
A borderless implementation of Rule 110
A Rule 110 simulation written as an ed(1) script.
Unidimensional Cellular Automata Explorer managing _arbitrary rules_
A super powerful Typescript library for cellular automation
Rule110 Cellular Automata ASIC for Tiny Tapeout 05
A cellular automaton (CA) explorer to understand and unveil properties of CA in 1D.
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.
Ruby implementation for different cellular automata
An implementation of the Turing-complete Rule 110 monodimensional cellular automaton in HTML5 canvas
Application for the Exploration and Analysis of 1D Cellular Automata
Visualise any possible elementary cellular automaton, where N is the Wolfram code
An elementary cellular automaton with interesting behaviour on the boundary between stability and chaos.
Emulator that uses the power of OpenGL to breed digital life forms.
A simple program to demonstrate the universality of a general-purpose LLM
Rule 110 is a one-dimensional elementary cellular automaton that is Turing-complete, meaning it can perform any universal computation given the right initial setup. This a virtual computer, assembly language, high level language, interface and graphical representation of a Rule110 computer as produced by guiding Claude.
To associate your repository with the rule110 topic, visit your repo's landing page and select "manage topics."