Smallest number of variables for undecidable Hilbert's Tenth Problem over Z
Determine the least integer n for which no algorithm decides whether an arbitrary integer-coefficient polynomial in at most n variables has an integer zero.
Status Open · subcases solved Status review date not recorded in this edition
Listed by ProofAtlas. Status qualification is attributed to ProofAtlas; no full resolution is certified here.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.