> The only other thing I'll state is that Life is a Turing-complete machine, so with right initial states it can "do" any computer algorithm. This only hints a

> The only other thing I'll state is that Life is a Turing-complete machine, so with right initial states it can "do" any computer algorithm. This only hints at the more important part: only a Turing-complete language can implement Life. Thus, an implementation of Life in a particular language is proof that that language is Turing-complete.