This tag doesn't have any usage information yet.
This tag doesn't have a detailed wiki yet.
[Rule 110] is a Turing complete cellular automaton. It is defined as follows:
Take as initial value a sequence of symbols that's infinite to both sides, which consists only of two different symbol...
posted 1y ago
· last activity
This community is part of the Codidact network.
We have other communities too — take a look!
You can also join us in chat!
Want to advertise this community? Use our templates!
Like what we're doing? Support us! Donate