“I demonstrate that it is possible to run any bounded computation in Doom, minus constraints on level size.”
For decades the joke was whether a toaster could run Doom. Now Doom runs the computation. It’s vanilla Doom 2 with monsters walking through doors and teleporters as logic gates. He’s careful to say he hasn’t proven it’s Turing complete. Pointless and brilliant.