“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… — Richard Bookstaber Copy Share Image
