Computational power equivalence

• A cellular automaton can simulate a universal Turing machine (Turing-complete)

• Proved by Matthew Cook for rule 110

• Result previously known for more complicated games as the game of life