““Alan Turing’s halting problem: you can’t know if the cells will all die off without running the game until they do die off. Thus, Life, a two-state process governed by four rules, is computationally irreducible. Von Neumann designed the universal constructor with the objective of self-replication; Conway designed his cellular automaton without any specific objective in mind. But he observed, “If you couldn’t predict what it did, then probably that is because it is capable of anything.””