2 ms·
According to Wikipedia, a cellular automaton running the game of life rules is Turing complete. So it can compute anything that a Universal Turing Machine can c
by andyjohnson0 7y ago
According to Wikipedia, a cellular automaton running the game of life rules is Turing complete. So it can compute anything that a Universal Turing Machine can compute [1] - In other words, anything that a conventional computer can compute.
[1] https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life
- wizzwizz4 7y agoIncluding Tetris. https://codegolf.stackexchange.com/q/11880/43394 https://codegolf.stackexchange.com/q/11880/43394