Re:Conway's Game of Life – Trying It on Images
by amyjess on Tuesday March 17, 2015 @05:13PM
(#9221519)
> 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.
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.