Wolfram has conjectured that many, if not all class 4 cellular automata are capable of universal computation.

"Our moon hopped forward a bit too far in the universal computation, just as a program advances in little leaps."

So even the mechanism that drove the universal computation had its limits.

But who you were, what you did, how you lived, will always remain embedded in the universal computation.

Matthew Cook proved Rule 110 capable of supporting universal computation.

Using this method it is possible to show that even one-dimensional reversible cellular automata are capable of universal computation.

Rule 110 has been shown to be capable of universal computation.

Rule 54 is Class 4, but it remains unknown whether it is capable of universal computation.

The Q*bert neighborhood may be used to support universal computation via a simulation of billiard ball computers.

This means that the ant is capable of universal computation.