all notes
rule 110
words:
18
+
2
=
20
last update:
#public
1D finite state automata [[state-machine]]
can be used to verify that a [[programming languages]] is [[turing-complete]]
https://en.wikipedia.org/wiki/Rule_110