Twenty Problems in the Theory of Cellular Automata (1985):
How common are computational universality and undecidability in cellular automata?
If a system is capable of universal computation, then with appropriate initial conditions, its evolution can carry out any finite computational process. A computationally universal system can thus mimic the behaviour of any other system, and so can in a sense exhibit the most complicated possible behaviour.