Browse › Partial differential equations › 376 Universal computation in forced Navier–Stokes flows
Prefix Instructions and Incompressible Flows
Open PDFCite Report a problem Add a reference or comment Interested in working on this Start a discussion
Edit NOTES.md · Existing issues · Source on GitHub
Abstract
Finite 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.
If the PDF does not display here, open it directly: Open PDF.
Notes
No notes yet. Add a reference, a comment or your name with the buttons above, or edit NOTES.md on GitHub.
Automatically collected notes (unreviewed)
work in progress
Collected automatically by AI tools (Claude Opus 5.5 and GPT-6 Astra, 2026-10-23) and not checked by a person. May be wrong or incomplete. Report an error.
Comments and discussion
- Warren D. Smith, post in the OpenAI Developer Community thread First look at mathematics manuscripts from an internal frontier model at OpenAI (forum post, 7 Oct 2026). Names "Universal computation in forced Navier–Stokes flows" and states that his own earlier viXra paper does "the same thing" and was not cited. [family-level]
- r/Physics discussion, OpenAI drops 722 math papers written by internal reasoning model (Reddit, October 2026). Non-specialist discussion contrasts family 376’s flat forced setting with earlier adapted-metric stationary flows. [family-level]
- Anders Sandberg (@anderssandberg), post on X (16 Oct 2026). Four-post thread calling the family the author's favorite in the release and a result "kind of suspected long before"; it describes a particle advected to a "0" or "1" box according to the computation's output, notes that the error budget tightens and total work grows quadratically with computation length, and concludes it is less "fluids can compute" and more "fluids can contribute the nonlinear step in computation". [family-level]
Related prior literature mentioned by others
- Warren D. Smith, On the Uncomputability of Hydrodynamics (viXra:2503.0157, posted 2025; written 2001 per its abstract). The work the forum post above claims overlaps with this family; its abstract argues that Navier–Stokes cannot be simulated by a Turing machine. [family-level]
- Andrey A. Agrachev and Andrey V. Sarychev, Solid Controllability in Fluid Dynamics (arXiv:math/0701818, 2007). Ying Xie's survey (arXiv:2610.17090) lists Agrachev–Sarychev controllability of Navier–Stokes by degenerate forcing as "not engaged" by family 376; this survey represents that line of work. [family-level]
- Søren Dyhr, Ángel González-Prieto, Eva Miranda and Daniel Peralta-Salas, Turing complete Navier–Stokes steady states via cosymplectic geometry (arXiv:2507.07696, 10 July 2025; PNAS Nexus 5, pgag131, May 2026). The r/Physics discussion above identifies this adapted-geometry stationary particle computation as prior context. [family-level]
Digests and expositions
- Ying Xie, What the Machine Invented: Mining New Mathematical Instruments from OpenAI's October 2026 Release of AI-Generated Mathematics (arXiv:2610.17090, 12 Oct 2026). Section 9.4.8 summarizes family 376 ("nine closely related manuscripts"), its antecedents, and caveats such as exact-real reachability without finite-precision tolerance. [family-level]
- Latent Seminar, Universal computation in smooth forced Navier–Stokes flows (6 October 2026). Explains history retention and planar area compensation. [family-level]
News and blogs
- Riley Scott Jacob (@RilScoJa), post on X (8 Oct 2026). Noting the released proofs give "no worked example", reports building one with Claude Opus 5.5: a smooth 3D flow from rest carrying a fluid particle through a shift-and-add multiplier computing 13 × 11 = 143. [family-level] [AI-generated per source]
Elsewhere
- Emergent Mind: family 376
Independent sites; their content is not reviewed here.
Cite
@misc{OAI:Prefix-Instructions-and-Incompressible-Flows-September-27-2026,
author = {{OpenAI}},
title = {{Prefix Instructions and Incompressible Flows}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/Prefix-Instructions-and-Incompressible-Flows-September-27-2026/manuscript.pdf}{OAI:Prefix-Instructions-and-Incompressible-Flows-September-27-2026}},
year = {2026}
}Lean formalization
OpenAI provides Lean files for this family: lean/docs/376.md. The Lean statements have not been checked by people against the paper's claims.
Family 376: Universal computation in forced Navier–Stokes flows
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.
Other papers in this family:
- Finite Instructions and Solenoidal Shear Flows · September 27, 2026
- A Fixed Particle Test for Computation in a Forced Viscous Flow · September 27, 2026
- Universal Computation with Eventually Stationary Navier–Stokes Forcing · September 27, 2026
- Geometric Programs for Solenoidal Forcing · September 27, 2026
- Computation under Rapidly Vanishing Navier–Stokes Forcing · September 27, 2026
- Velocity-Field Detection of Computation in Forced Navier–Stokes Flows · September 27, 2026
- Scalar Potentials and Slow Clocks for Forced Fluid Computation · September 27, 2026
- Incompressible Box Transport and Finite Computation · October 6, 2026