2 ms·
Fascinating. And given that GoL is Turing complete, it should be theoretically possible to implement a Turing machine in the cellular automaton that could then
by andyjohnson0 4y ago
Fascinating. And given that GoL is Turing complete, it should be theoretically possible to implement a Turing machine in the cellular automaton that could then run a copy of the Forth interpreter running the APL program running the CA.