Theorem 1.1
In Hilbert’s tenth problem over the rational numbers, 6 October 2026
Possible match to OpenAI’s description, selected from the papers’ main statements because it shares the most wording. No review confirming the selection is recorded.
There is no algorithm which, given a polynomial f\in\Z[X_1,\ldots,X_n], with n part of the input, decides whether f has a zero in \Q^n.