Finite Instructions and Solenoidal Shear Flows

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]

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 Theorem 1.1(iii)'s halting-iff-entry formulation on the flat torus (not in this paper's bibliography).

Digests and expositions

• 4vmp5pkwz4-pixel, v4.378.0: the fluid computer — forced Navier–Stokes in which one particle decides halting (PR #493, HCC repository) (GitHub pull request, merged 8 Oct 2026). Adds an interactive simulation of the reversible recorder and seven-stage shear period, citing this manuscript as the source of the theorem; not a Lean formalization. [AI-generated per source]
• 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 reciprocal shears and intermediate trajectory bounds. [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]