🌪 The Mirrane Chaos Classification Problem

The Challenge

Given a system of differential equations with rational coefficients:

Does the system ever enter a chaotic attractor?

That's it. Rational coefficients, a concrete dynamical system, and a yes-or-no question.

Why This Is Extraordinary

Deterministic means the future is uniquely determined by the present. There is no randomness. Every trajectory is fixed.

And yet — no algorithm can classify the long-term behavior of all such systems.

The trajectory might settle to a fixed point, oscillate periodically, or wander chaotically forever. For any specific system you can simulate. But for the general question — there is no decision procedure.

Why (In One Line)

Cristopher Moore showed that certain classes of dynamical systems can simulate Turing machines, making trajectory classification at least as hard as the Halting Problem.

What This Means

Even fully deterministic systems can have behavior that cannot be classified by any algorithm.

Chaos hides computation.

The universe runs on differential equations. Some of those equations contain questions that no computer — not even a perfect one with infinite time — can answer.

In Plain Language

You write down simple equations. You ask: "will this go chaotic?" The answer exists. But no method can always find it.

Prediction has a ceiling. Not because we lack tools — but because reality itself is rich enough to encode the uncomputable.