Turing Complete

Regex Is a Turing-Complete Programming Language. That’s Why It’s Ruining Your Code.

📅 July 28, 2026 📂 Tech Industry

Regular expressions are not just pattern matchers—they’re a Turing-complete programming language. That theoretical power makes them a practical liability. Learn why every developer has been burned by regex, and how to stop using it like a weapon of mass destruction on your codebase.

Regex Is a Computer. I Have Proof.

📅 July 26, 2026 📂 Tech Industry

A developer built a full Doom game that runs entirely on regex find-and-replace operations, proving that regex is Turing complete. The game is absurdly slow, but it works — and it challenges everything we think we know about what counts as a computer. It’s a stunning reminder that computation is universal, not just the domain of silicon.

Abstraction Computation Creative Coding Doom Minimalism Regex Turing Complete