1 · The essentials
These manuscripts describe how a fluid can carry out a computation through the motion of a chosen particle. The fluid begins at rest, and a carefully designed external force sets it moving. A finite procedure translates a machine and its input into a finite description of that force. The chosen particle enters a fixed target region exactly when the machine stops. The main setting is a fixed three-dimensional space with opposite faces identified, and the fluid has a fixed positive viscosity that can be computed. Companion constructions change how the force behaves over time or detect stopping through the fluid’s velocity instead. The main result has a Lean formalization, but the supplied summary does not specify its exact coverage, and the repository history records a correction or revision for this family.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine a programmed system of moving walkways that routes a marker through successive instructions, sending it into a marked doorway only when the program stops. Here the walkways are replaced by smooth fluid motions, and keeping a record of earlier instructions helps make those motions compatible with a fluid that does not compress.
Why it matters
The construction connects finite computational instructions to a precise question about continuous fluid motion: will a designated particle ever enter a designated region? It does so with positive viscosity and a fluid initially at rest, rather than encoding the computation in an already moving initial state. The companion manuscripts explore how this connection survives under different requirements on the force and on the way the computation is observed.
2 · Going further
The central problem is to translate a Turing machine and a finite input into a smooth external force for the incompressible Navier–Stokes equations. On a fixed flat three-torus, at any fixed positive computable viscosity , the construction starts with zero velocity and arranges that a fixed particle enters a fixed open detector exactly when the machine halts. The repository summary specifies a terminating compiler producing a finite force program. In the main manuscript, the pressure is zero and the force is solenoidal, mean-zero, and periodic after initialization.
The main manuscript realizes finite reciprocal affine instructions using smooth incompressible shear flows. A reversible one-head recorder supplies a finite transition table while retaining computational history. Crucially, the geometric construction acts on entire closed rectangles, not just selected points, and controls trajectories between instruction endpoints. Separate heights handle overlap between source and target regions, while an endpoint-size estimate bounds excursions independently of the reciprocal scaling factor. Related manuscripts develop history processors for instructions that erase information or change planar area, compensate for area changes through normal motion, and transport whole solid boxes using localized curls, storage, and obstacle detours.
The companion manuscripts offer distinct choices of timing and forcing, rather than one construction satisfying every listed property. These include forcing periodic from time zero, forcing stationary after time one, and constructions whose derivatives are square-integrable in time. One manuscript uses longer time steps to compensate for finer spatial gates; another describes rapidly vanishing force and velocity derivatives while retaining one unit of physical time per machine step. A compact-support construction uses three scalar potentials and an unbounded logarithmic clock to obtain decay for mixed derivatives with time order .
Other companions change the observation itself. A velocity-field detector tests the third velocity component at a point on the unit torus, while a separate construction on uses an integral test. Their analysis uses an advection–diffusion equation, with short stirring bursts controlling pointwise error in one case and a moving cutoff controlling escaped mass in the other. The box-transport manuscript additionally gives a three-stack recorder, compactly supported forcing periodic after loading, and a fixed open-cube particle detector, with all-time observation arguments and stated pressure comparison classes.
Useful notions
- Machines, inputs, and halting
- Velocity fields and particle trajectories
- Incompressibility and viscosity
- Smooth functions and derivatives
- Periodic spaces and periodic forcing
What was known before / what is new
Before
The supplied source takes Turing machines, finite instruction tables, and the incompressible Navier–Stokes equations as its starting language. It does not provide a historical account of earlier fluid-computation results or identify a previously posed open problem. No priority claim or broader historical comparison can be drawn from these abstracts alone.
New
The main manuscript presents a complete machine-to-fluid construction through finite reciprocal affine instructions and incompressible shears, including control over full closed rectangles and intermediate trajectories. The repository summary emphasizes a terminating compiler, a fixed particle and detector, zero initial velocity, and fixed positive computable viscosity. The companions describe alternative information-recording mechanisms, forcing schedules, spatial settings, and particle or velocity-field observations.
Limits and assumptions
The conclusions concern specially constructed smooth external forces encoding a prescribed machine and input; they do not assert the same computational behavior for arbitrary forces or unforced flows. The main setting is a flat three-torus with positive computable viscosity and zero initial velocity, while some companions use different domains, compact spatial support, or different detectors. Periodicity, eventual stationarity, square-integrability, and decay belong to distinct constructions and should not be combined into a single claim. The main result has a Lean formalization, but the supplied material does not identify exactly which claims it covers; the companion claims are described in manuscript abstracts and should not automatically be treated as formalized. The repository history records a correction or revision, without details here about its nature. The source does not state a specific remaining open problem.
Mini glossary
- Flat three-torus —
- A three-dimensional periodic space represented by a box whose opposite faces are identified.
- Incompressible flow —
- Fluid motion that preserves volume.
- Solenoidal force —
- A force field with zero divergence.
- Mean-zero force —
- A force whose spatial average is zero.
- Reversible recorder —
- A computational mechanism that retains instruction history so that earlier steps can be recovered.
- Mixed derivative —
- A derivative formed by differentiating with respect to spatial coordinates, time, or both.
Keywords : Navier–Stokes · Universal computation · Incompressible flows
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
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.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Finite Instructions and Solenoidal Shear Flows
27/09/2026We realize finite reciprocal affine instruction maps by smooth incompressible shear flows on a flat three-torus. Applied to a reversible one-head recorder with a finite transition table, this gives a complete machine-to-fluid construction: a fixed particle enters a fixed open strip exactly when a given machine halts, with zero initial velocity, zero pressure, and a solenoidal mean-zero force that is periodic after initialization. The construction acts on full closed rectangles and controls every intermediate trajectory. Separate heights resolve overlap between sources and targets, and an endpoint-size estimate controls all excursions independently of the reciprocal scaling factor.
A Fixed Particle Test for Computation in a Forced Viscous Flow
27/09/2026We construct smooth external forces for incompressible Navier–Stokes flow on a fixed flat three-torus at any fixed positive computable viscosity, from zero initial velocity, such that a fixed particle enters a fixed open set exactly when a prescribed Turing machine halts. Every mixed derivative of the force and velocity is bounded and square-integrable in time in spatial supremum norm. The construction uses the machine's ordinary instructions, records their history in a third coordinate, and compensates for finer spatial gates by longer time steps.
Universal Computation with Eventually Stationary Navier–Stokes Forcing
27/09/2026At every fixed positive computable viscosity, we construct smooth mean-zero forces on the flat three-torus that become stationary after time one and make a fixed particle, initially in a fluid at rest, enter a fixed open set exactly when a prescribed Turing machine halts. The force has bounded derivatives of every order and a finite effective description. A reversible recording table is realized on whole planar rectangles by Hamiltonian motions, then driven by a mean-zero spatial clock. Separate choices give periodic forcing from time zero or a force whose derivatives are square-integrable in time.
Geometric Programs for Solenoidal Forcing
27/09/2026We construct smooth solenoidal mean-zero forces, periodic from time zero, for which a fixed particle on a flat three-torus reaches a fixed open strip exactly when a given machine halts. The initial fluid velocity and the pressure are zero. We also realize positive diagonal maps on coding sheets by incompressible shears, with explicit normal compensation for changes of planar area, and reciprocal maps on whole boxes of positive thickness. Complete local inverses, initialization rules, and intermediate trajectory bounds connect these geometric constructions to finite computations.
Prefix Instructions and Incompressible Flows
27/09/2026Finite prefix instructions may change area and erase information. We give explicit history processors and smooth incompressible motions that retain that information and realize every instruction on its full domain. A first application assigns each machine and finite input a smooth mean-zero force on the flat unit three-torus, at any fixed positive computable viscosity. The solution starts from rest; a fixed particle enters a fixed open strip exactly when the machine halts. The force repeats with period one after an initial loading interval. We then prove alternative realizations using full boxes, normal compensation, invariant planes, and a spatial clock. The constructions specify their initialization, comparison class, derivative bounds, and continuous-time observation. Exact formulas and effective cutoffs provide finite descriptions of the fields and all their derivatives.
Computation under Rapidly Vanishing Navier–Stokes Forcing
27/09/2026At any fixed positive computable viscosity, smooth forces can make a fixed fluid particle detect the halting of an arbitrary machine, starting from rest, while every mixed derivative of the force and velocity decreases faster than every inverse power of time. We give three complete memory constructions: compact moving curls, alternating fractional coordinates, and a periodic lattice on the flat three-torus. Each machine step takes one unit of physical time. The constructions retain earlier records at separated spatial scales and use an exact open detector with a shrinking signal.
Velocity-Field Detection of Computation in Forced Navier–Stokes Flows
27/09/2026We construct smooth forces for three-dimensional incompressible Navier–Stokes flow, from rest at any fixed positive computable viscosity, whose velocity field detects whether a prescribed machine halts. On the unit flat torus, a pointwise test of the third velocity component uses successively shorter stirring intervals in a fixed spatial region. On , an integral test uses an expanding array of translation regions and a force with globally bounded mixed derivatives. The vertical velocity solves an advection–diffusion equation: short bursts control its pointwise error in the first construction, and a moving cutoff controls the total escaped mass in the second.
Scalar Potentials and Slow Clocks for Forced Fluid Computation
27/09/2026We construct smooth forces of fixed compact spatial support for three-dimensional incompressible Navier–Stokes flow from rest whose particle at the origin detects halting by entering a fixed half-space. Every mixed derivative of the force and velocity decays at rate for time order j. Three scalar potentials lift a coded rectangle, perform its instruction, and lower its image; an unbounded logarithmic clock supplies the decay. We also realize area-changing prefix instructions on an invariant torus plane, and construct a planar Hamiltonian processor admitting periodic forcing, stationary forcing after startup, and a velocity-field detector through a companion diffusion theorem.
Incompressible Box Transport and Finite Computation
06/10/2026We realize finite positive diagonal affine maps of determinant one by effective smooth incompressible flows on neighborhoods of entire closed rational solid boxes. The source and target families are each disjoint, but may overlap each other. The construction uses localized curls, evacuation to storage and obstacle detours. A balanced three-stack recorder then assigns every machine and finite input a smooth Navier–Stokes force with one compact spatial support, periodic after a loading interval, at any fixed positive computable viscosity. The fluid starts at rest, and one fixed particle enters one fixed open cube exactly when the machine halts. Further constructions give fixed torus charts, periodicity from time zero, alternative history guards and bounded or slab observers. Onto slow clocks yield separate decaying forces. Each construction includes an all-time observation proof, effective derivative bounds and a stated pressure comparison class.