 Earlier work by Julia Robinson, Martin Davis and Hilary Putnam – hence, MRDP – had shown that this suffices to show that every computably enumerable set is Diophantine.Hilbert's tenth problem asks for a general algorithm deciding the solvability of Diophantine equations.The conjunction of Matiyasevich's result with earlier results, collectively now termed the MRDP theorem, implies that a solution to Hilbert's tenth problem is impossible.