AI数学能力突飞猛进：LLM深度优先搜索与验证器如何改变问题求解

AI 摘要

文章讨论OpenAI和Anthropic的模型在数学领域取得突破，包括发现Erdős单位距离猜想的反例、证明CDC问题、Navier-Stokes问题，以及形式化费马大定理和推进黎曼猜想边界。作者借用Gowers的提示序列复杂度框架，分析LLM为何擅长数学：人类采用广度优先搜索，因验证成本高而门槛高；LLM采用深度优先搜索，配合自动验证器可低成本并行试错，从而改变问题求解模式。

正文节选

In May, an internal model at OpenAI found a counterexample to Erdős's unit distance conjecture. Open since 1946. Many experts had tried to prove it. OpenAI found a counterexample instead. A month later, OpenAI published a proof of the Cycle Double Cover (CDC) problem, then solutions to ten more open problems by July. And a proof of Navier Stokes in September. Anthropic published a formalization of the fermat's last theorem, and advanced bounds on Reimann's hypothesis. The models are suddenly goo

发布时间：2026-10-23 23:19

抓取时间：2026-10-23 23:22

来源机构：swyx and Latent Space