We still haven't determined whether it's possible to perfectly predict the outcome of any sufficiently complex cellular automaton using a simpler mathematical shortcut.
open
Global / Unspecified, Global
WS01290
Some cellular automata, like simple grid-based rule systems, produce behavior so complex that no shortcut prediction method has been proven to exist beyond simply running the simulation. This unresolved question touches on computational irreducibility and the philosophy of prediction.