Universal computation in forced Navier–Stokes flows
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)
- Finite Instructions and Solenoidal Shear Flows (PDF, opens in a new tab) September 27, 2026
- A Fixed Particle Test for Computation in a Forced Viscous Flow (PDF, opens in a new tab) September 27, 2026
- Universal Computation with Eventually Stationary Navier–Stokes Forcing (PDF, opens in a new tab) September 27, 2026
- Geometric Programs for Solenoidal Forcing (PDF, opens in a new tab) September 27, 2026
- Prefix Instructions and Incompressible Flows (PDF, opens in a new tab) September 27, 2026
- Computation under Rapidly Vanishing Navier–Stokes Forcing (PDF, opens in a new tab) September 27, 2026
- Velocity-Field Detection of Computation in Forced Navier–Stokes Flows (PDF, opens in a new tab) September 27, 2026
- Scalar Potentials and Slow Clocks for Forced Fluid Computation (PDF, opens in a new tab) September 27, 2026
- Incompressible Box Transport and Finite Computation (PDF, opens in a new tab) October 6, 2026