Number theory · Oct 6, 2026
Hilbert’s tenth problem over Q
Proves that no algorithm decides whether an integer-coefficient polynomial in an arbitrary number of variables has a rational zero, resolving Hilbert's tenth problem over ℚ negatively.
Scope and what remains
A supporting formalized elliptic-curve result is not a complete formalization of the undecidability proof; no main formal scope link is provided in this snapshot.
Contributors
OpenAI source publisher and an unnamed unreleased internal model. Exact paper-level human roles are not disclosed by the family summary.
AI systems: Unreleased OpenAI model