Game of Life has the hashlife algorithm that can provide exponential speed-ups but with increased memory usage.

A computer in the Game of Life therefore implies there is an algorithm that can exponentially speed up arbitrary computation - again at the cost of memory overhead.

Does this say anything towards P=NP or other complexity questions?