Towards a Theory of Bugs: The Ruliology of the Unexpected

Bugs aren't just human mistakes — they emerge from the fundamental nature of computation itself. Using Turing machines and cellular automata as simple test beds, this deep-dive explores how computational irreducibility makes some bugs impossible to predict without actually running the code. Formal proofs can verify bug-free programs, but only within narrow limits — and AI-generated code faces the same unavoidable constraints.