# Scientific prediction claim and computational-limit audit

Family 376: Universal computation in forced Navier–Stokes flows. First source-informed review, 9 October 2026 Australia/Brisbane.

## Problem and potential new use

Scientific software reviewers can record why an exact infinite-time reachability claim for specially encoded forced flows requires a precise event, observation horizon and comparison class.

## Applicability and commercial boundary

The Turing constructions use designed smooth forcing and exact observations across unlimited time; they do not offer a practical fluid computer or show all ordinary finite-horizon CFD forecasts are impossible. Scope coverage varies across nine manuscripts and references an older box-transport version, so paper-level mapping is essential.

## Initial business decision

Prototype evidence workflow. Commercial demand and profitability remain hypotheses. Research usefulness is not evidence of a buyer budget.

## Next verification action

Map each selected statement to its exact manuscript version, event, force class and formal module; begin with a finite-program manifest without asserting undecidable-case resolution.

## Evidence scope

The catalog statement and main-paper abstract or introductory theorem passages were individually reviewed. Available family-level scope documents were inspected, with attention to version differences and exclusions. This is a first application triage, not a full proof audit or independent Lean verification. Family 376 has nine paper abstracts inspected; selected scopes are not assumed to cover all nine papers in full. Source revision `fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb`. See [source metadata](source.json).

## Pinned sources

- [Finite Instructions and Solenoidal Shear Flows](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Finite-Instructions-and-Solenoidal-Shear-Flows-September-27-2026/manuscript.pdf)
- [A Fixed Particle Test for Computation in a Forced Viscous Flow](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/manuscript.pdf)
- [Universal Computation with Eventually Stationary Navier–Stokes Forcing](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Universal-Computation-with-Eventually-Stationary-Navier-Stokes-Forcing-September-27-2026/manuscript.pdf)
- [Geometric Programs for Solenoidal Forcing](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Geometric-Programs-for-Solenoidal-Forcing-September-27-2026/manuscript.pdf)
- [Prefix Instructions and Incompressible Flows](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Prefix-Instructions-and-Incompressible-Flows-September-27-2026/manuscript.pdf)
- [Computation under Rapidly Vanishing Navier–Stokes Forcing](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Computation-under-Rapidly-Vanishing-Navier-Stokes-Forcing-September-27-2026/manuscript.pdf)
- [Velocity-Field Detection of Computation in Forced Navier–Stokes Flows](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Velocity-Field-Detection-of-Computation-in-Forced-Navier-Stokes-Flows-September-27-2026/manuscript.pdf)
- [Scalar Potentials and Slow Clocks for Forced Fluid Computation](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Scalar-Potentials-and-Slow-Clocks-for-Forced-Fluid-Computation-September-27-2026/manuscript.pdf)
- [Incompressible Box Transport and Finite Computation](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Incompressible-Box-Transport-and-Finite-Computation-October-6-2026/manuscript.pdf)
- [Selected formal scope](https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/376.md)