Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes

TL;DR

This work reframes algorithmic questions about randomness through the lens of spin-glass physics, linking information-theoretic optima to computational feasibility via the Parisi variational principle and its rigorous validation. It shows that for canonical problems like clique/independent set, ground states of \(p\)-spin models, and random \(K\)-SAT, fast algorithms can misalign with the true optima, with precise thresholds governed by clustering, overlaps, and ultrametricity. The paper then presents algorithmic breakthroughs (notably ultrametric-guided approaches for p=2 and the Parisi-anchored analysis) alongside robust hardness certificates (OGP and Branching-OGP) that formally delineate when near-optimal computation is blocked for broad algorithm classes. Collectively, these results map a sharp boundary between tractable and intractable optimization under randomness, offering deep insights into when physics-inspired methods can achieve near-optimal performance and when fundamental barriers arise.

Abstract

The 2021 Nobel Prize in physics was awarded to Giorgio Parisi ``for the discovery of the interplay of disorder and fluctuations in physical systems from atomic to planetary scales,'' and the 2024 Abel Prize in mathematics was awarded to Michel Talagrand ``for his groundbreaking contributions to probability theory and functional analysis, with outstanding applications in mathematical physics and statistics.'' What remains largely absent in the popular descriptions of these prizes, however, is the profound contributions the works of both individuals have had to the field of \emph{algorithms and computation}. The ideas first developed by Parisi and his collaborators relying on remarkably precise physics intuition, and later confirmed by Talagrand and others by no less remarkable mathematical techniques, have revolutionized the way we think algorithmically about optimization problems involving randomness. This is true both in terms of the existence of fast algorithms for some optimization problems, but also in terms of our persistent failures of finding such algorithms for some other optimization problems. The goal of this article is to highlight these developments and explain how the ideas pioneered by Parisi and Talagrand have led to a remarkably precise characterization of which optimization problems admit fast algorithms, versus those which do not, and furthermore to explain why this characterization holds true.

Figures (4)

• Figure 1: Clustering phase transition at $\alpha_{\rm Clust}\approx \alpha_{\rm ALG}$ . Below $\alpha_{\rm Clust}$ a bulk of the solution space (blue) is a giant connected set. Above $\alpha_{\rm Clust}$ a bulk of the set is partitioned into (blue) clusters, with exponentially small exceptions (grey)
• Figure 2: Overlap Gap Property is an obstruction to stable algorithms. The algorithmic path (blue curve) has to jump (red section) from the small distance ($\le \nu_1$) region to the large distance ($\ge\nu_2$) region in the space of solutions $\Theta$.
• Figure 3: Ultrametric tree of solutions in $[-1,1]^n$. End points of the curve correspond to corners of the cube. The Parisi measure has no gap in the support, reflected in the tree branching continously.
• Figure 4: Ultrametric tree of solutions when the Parisi measure has a gap in the support leading to gaps in branching locations.

Theorems & Definitions (8)

• Theorem 1.1
• Theorem 3.1
• Definition 4.1
• Definition 4.2
• Theorem 4.3
• Theorem 4.4
• Theorem 5.1: Informal
• Theorem 6.1