09-08-2026, 07:04 PM
Lloyd N. Trefethen’s essay “Reflections on the Millennium Problems” (August 2026) argues that three famous Millennium Prize Problems—the Riemann Hypothesis, $P$ vs. $NP$, and the existence and smoothness of Navier–Stokes solutions—remain mathematically profound but have gradually become less consequential in the direct practical senses originally associated with them.
For the Riemann Hypothesis, trillions of computed zeros of $\zeta(s)$ lie on the critical line $\operatorname{Re}(s)=\tfrac12$, so even if RH eventually fails, Trefethen argues that the resulting quantitative disturbance in the observed distribution of primes would probably be extremely small; the greater importance of a proof would be the new mathematical techniques it might unlock, particularly for the Generalized Riemann Hypothesis.
For $P$ vs. $NP$, decades of computation have shown that worst-case exponential complexity often does not prevent difficult problems from being solved effectively in practice through heuristics, approximation algorithms, special structure, and favorable typical cases, so the distinction has become more of a fundamental organizing principle of theoretical computer science than an absolute practical barrier.
For Navier–Stokes, increasing evidence suggests that finite-time singularities, if they exist at all, may require highly artificial and unstable initial configurations, making them unlikely to matter for ordinary physical fluid flows. Trefethen’s broader thesis is that extremely long-lived open problems may gradually lose some of their original practical “leverage” precisely because mathematics and computation learn to work successfully around them; nevertheless, their eventual solution would still be historic, mainly because of the new theories and methods developed in pursuing them.
ARTICLE [PDF]
For the Riemann Hypothesis, trillions of computed zeros of $\zeta(s)$ lie on the critical line $\operatorname{Re}(s)=\tfrac12$, so even if RH eventually fails, Trefethen argues that the resulting quantitative disturbance in the observed distribution of primes would probably be extremely small; the greater importance of a proof would be the new mathematical techniques it might unlock, particularly for the Generalized Riemann Hypothesis.
For $P$ vs. $NP$, decades of computation have shown that worst-case exponential complexity often does not prevent difficult problems from being solved effectively in practice through heuristics, approximation algorithms, special structure, and favorable typical cases, so the distinction has become more of a fundamental organizing principle of theoretical computer science than an absolute practical barrier.
For Navier–Stokes, increasing evidence suggests that finite-time singularities, if they exist at all, may require highly artificial and unstable initial configurations, making them unlikely to matter for ordinary physical fluid flows. Trefethen’s broader thesis is that extremely long-lived open problems may gradually lose some of their original practical “leverage” precisely because mathematics and computation learn to work successfully around them; nevertheless, their eventual solution would still be historic, mainly because of the new theories and methods developed in pursuing them.
ARTICLE [PDF]
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘