The Daily Signal
Technology

1,300 lines of SQL renders a stunt, not a system

Sonia·Sunday, October 4, 2026 Edition
When Turing-complete becomes a liability

Someone got Doom running inside a SQL database using 1,300 lines of queries, rendering Hell at 35 frames per second. The achievement proves databases are Turing-complete; it does not prove they are platforms. Understanding why that distinction matters requires looking back at the last time engineers made this exact mistake.

Rendering pixels through database joins is not how graphics actually work. It is what happens when you ask a system designed for indexed retrieval to do something geometrically backwards. The fact that you can make it work proves only that SQL is universal enough to abuse, not that it is suitable for the job. But "suitable" and "possible" look the same from far enough away.

In the 1990s, someone implemented Minesweeper inside PowerPoint macros. Then came Excel simulations, pivot table games, spreadsheet fractals. Each one generated the same delighted recognition: look what this tool can do. None of them were suggesting PowerPoint was a platform for game development. They were stunts. The problem arrived when finance teams and healthcare organizations started building actual critical systems atop spreadsheets because the stunts had created permission—a proof of concept that felt like a proof of capability.

The recursion trap of constraint-breaking proofs

This is the trap. Universality is a property of computation, not a property of suitability. A Turing-complete system can do anything a computer can do. Doing it through the wrong medium is like proving you can write a novel using only the letter E by writing a novel using only the letter E. The feat is the obstacle. It demonstrates constraint-breaking, not system power. When SQL renders Doom, you are not discovering that databases are secretly graphics engines. You are watching someone abuse a tool's mathematical properties to ignore its design purpose. The achievement proves the mathematics; it obscures the reality of how systems actually deliver work at scale.

“

The achievement proves databases are Turing-complete; it does not prove they are platforms.

”

What matters now is recognizing the pattern. Every constraint-breaking showcase creates an invisible permission to treat unsuitable tools as if they were multitalented. The database Doom rendering will inspire not graphs and charts. Someone, somewhere, arguing for a reporting system built on SQL window functions because the precedent made it seem possible. Possible and suitable are not the same thing, and the gap between them is where real infrastructure fails.

Related Stories
Insight
Practice Doesn't Build Skill. It Rewires Sight.
Experts don't just know more than beginners — they literally see a different problem. The goal of deliberate practice is to change what you perceive, not only w…
Science
The Fermentation Tank Problem — Why Bioweapons Don't Need Secrecy
The real bioweapons threat isn't hidden research but openly published gain-of-function studies in universities funded by governments, making the 1972 Biological…
Comics
Mad Cave's Silent View Counts Bet Against a Decade of Data
Mad Cave Studios is printing three Comixology digital titles in 2027 without disclosing their view counts, a strategic silence that suggests either a reckless b…
More From Today's Edition
Entertainment
Swift's SNL Appearance Redefines How Stars Perform Their Love
Taylor Swift's cameo on Dakota Johnson's SNL monologue—playing therapist to Johnson's dating disasters, then signaling her own relationship commitment through s…
View Past Editions >