A polynomial equation f(x_1,…,x_n)=0 with integer coefficients sought over ℤ (or ℚ). Hilbert's 10th problem (Matiyasevich 1970): no algorithm decides general solvability.
A polynomial equation f(x_1,…,x_n)=0 with integer coefficients sought over ℤ (or ℚ). Hilbert's 10th problem (Matiyasevich 1970): no algorithm decides general solvability.