Computation under Rapidly Vanishing Navier–Stokes Forcing

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). Part of a four-post thread on the family that notes the error budget tightens and total work grows quadratically with computation length, says this paper "seems to have a finite work limit, but needs to shrink", and concludes the family shows "fluids can contribute the nonlinear step in computation". [family-level]

Formalization

• OpenAI math release, Lean scope note Universal computation in forced Navier–Stokes flows (lean/docs/376.md) (release Lean documentation, Oct 2026). Lists this paper; the formalized statement covers halting detection with alternating-coordinate memory, velocity, force and all mixed derivatives decaying faster than every inverse power of time, and a shared compact support, with particle-halting equivalence in the stated comparison class.

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]

Possibly relevant literature (found by the agent, not checked)

• Robert Cardona, Eva Miranda and Daniel Peralta-Salas, Turing universality of the incompressible Euler equations and a conjecture of Moore (arXiv:2104.04356, IMRN 2021). Time-dependent Euler on a high-dimensional compact manifold where halting is equivalent to a solution entering an open set; compare with this paper's exact open detector under decaying forcing (not in its bibliography).

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 and lists forces decaying faster than any power among its variants. [family-level]
• Latent Seminar, Universal computation in smooth forced Navier–Stokes flows (6 October 2026). Explains shrinking spatial steps and exact detection. [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]