Universal computation in forced Navier–Stokes flows

Formal proof listed 9 papers September 27, 2026
What the paper claims, in its own words

Constructs viscous incompressible flows starting from rest on a fixed flat three-dimensional domain that perform universal computation under smooth external forcing. A terminating compiler turns a Turing machine and input into a finite program for the force, so a designated particle reaches a fixed region exactly when the machine halts. The viscosity is fixed, positive and computable.

The plain-language explainer for this entry is still coming.

The original papers (9)