Conway's game of Life [can simulate a universal Turing machine](http://rendell-attic.org/gol/tm.htm) which means that it is indeed undecidable by reduction from the halting problem.