Exact variable accounting for fixed-variable Hilbert's Tenth Problem over the integers
Statement
Question 15 (Rojas). What is the smallest n such that Hilbert's Tenth Problem over Z
restricted to one polynomial in n variables is undecidable? Minimal n is known to be 2 ≤ n ≤ 22 by Matijaseviˇ c, and probably 2 ≤ n ≤ 11 by some Chinese. There is some evidence that n = 3.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.