Conway's game of Life can simulate a universal Turing machine which means that it is indeed undecidable by reduction from the halting problem.
Peter Shor
- 6.3k
- 4
- 55
- 65