OpenAI · 376-06 · 2026-09-27 · Partial differential equations
Computation under Rapidly Vanishing Navier–Stokes Forcing
preprints/Computation-under-Rapidly-Vanishing-Navier-Stokes-Forcing-September-27-2026
Family 376. Universal computation in forced Navier–Stokes flows.
The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.
Read against the standing problems
Emergence. This language is not spacetime emergence and not a derivation of a metric. Oai276-A's one-use Holevo certificate does not derive a metric. Oai279-A's finite factoring circuit does not derive a metric. Oai227-A's finite SK certificate does not derive a metric. Oai119-A's finite Hellinger certificate does not derive a metric. Oai211-A, Oai290-A, Oai265-A, and Oai265-B do not supply that derivation. Oai280-A does not supply a metric derivation. Oai280-B does not supply a gravitational surface. Oai280-C does not supply a gravitational dictionary. Oai282-A does not supply Einstein dynamics. Oai282-B does not supply Einstein dynamics. Oai069-A does not supply a gravitational dictionary. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. Oai119-A · Oai227-A · Oai279-A · Oai276-A · Oai069-A · Oai282-B · Oai282-A · Oai280-C · Oai280-B · Oai280-A · Oai211-A · Oai290-A · Oai265-B · Oai265-A · En07-C · En07-B · En07-A · En06-B · En05-C · En06-A · En05-B · En05-A · En04-A · III · VI · XVII-A · En02-A
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.
At 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.
Preprint source and Lean scope
The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.
This preprint is named in the Lean scope note for 376: Universal computation in forced Navier–Stokes flows. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.
SolenoidalSheetPrograms.lean · SolenoidalSheetPrograms.lean
NavierStokesAlternating.lean · NavierStokesAlternating.lean
NavierStokesVelocity.lean · NavierStokesVelocity.lean
BalancedBoxRouting.lean · BalancedBoxRouting.lean
BalancedThreeStack.lean · BalancedThreeStack.lean
ForcedNavierStokesComputation.lean · ForcedNavierStokesComputation.lean
Emergence
Forced Navier–Stokes computation is not spacetime emergence
Family 376 records universal computation in forced Navier–Stokes flows. That fluid statement is not spacetime emergence and not a derivation of a metric. The authors are OpenAI. The companion does not verify those proofs. O.1 stays NOT_CLOSED.