Why is the video game Braid Turing-complete?
Because Braid can simulate a variant of Rush Hour, which is at least PSPACE-hard.

Additionally, Braid itself is undecidable because it can simulate a counter machine which is equivalent to a Turing machine, and thus determining if any general Braid level is solvable is similar to solving the halting problem, which is undecidable.