Techniques › Particles & generative › Cellular automata
Rule 110 automaton
A one-dimensional binary automaton produces localized structures that move across a field of diagonal rows.
Also called Turing-complete automaton.
Use it in a promptTechniques › Particles & generative › Cellular automata
A one-dimensional binary automaton produces localized structures that move across a field of diagonal rows.
Also called Turing-complete automaton.
Use it in a prompt