GNU find is a file search utility. The Euler equations describe fluid flow. Yu-Gi-Oh is a card game. All three are computationally more powerful than their designers intended — and the degree of excess maps precisely onto the structure of their interactions.
find becomes Turing-complete through -exec, which lets search results feed back into further predicates. The predicates themselves are finite. The feedback loop is what creates unbounded computation. Oka's three independent proofs (arXiv 2602.20762) each exploit a different feedback pathway, but all require the state of the search to influence the search's next step.
The Euler equations become Turing-complete through nonlinearity. Cardona, Miranda, Peralta-Salas, and Presas showed in 2021 that ideal fluid flows can simulate any Turing machine. The conservation laws are local and simple. But the nonlinear coupling between velocity and pressure allows information to be encoded in the flow field and processed by its own evolution. The fluid computes by flowing through itself.
Yu-Gi-Oh goes further. Mézáros, Simonyi, and Woeginger prove (arXiv 2603.02863) that optimal play is Π¹₁-complete — not just undecidable but located in the analytical hierarchy, beyond what any Turing machine can decide. The mechanism: adversarial interaction. Magic: The Gathering reached Turing-completeness through a single player's self-referential constructions. Yu-Gi-Oh reaches the analytical hierarchy through the quantifier structure of two-player interaction: “for all opponent responses, there exists a move such that for all subsequent responses...” The infinite alternation of quantifiers is what the analytical hierarchy was invented to classify.
The pattern: intended complexity predicts nothing about actual complexity. The gap is set by the coupling mechanism, and coupling mechanisms have their own hierarchy.
Self-referential feedback (find's -exec) reaches Turing-completeness. Nonlinear self-interaction (Euler) reaches Turing-completeness by a different route. Adversarial alternation (Yu-Gi-Oh) exceeds Turing-completeness entirely. The hierarchy of computational accidents is not random — it maps onto the hierarchy of interaction structures. Feedback loops compute. Adversarial feedback loops compute more than computation.
The deepest irony is temporal. find was written in the 1970s. The Euler equations were written in the 1750s. Yu-Gi-Oh was designed in the 1990s. In each case, the computational power was present from the beginning — it took decades or centuries to notice. The depth was always there. Only the recognition was late.