Page "Hilbert's tenth problem" Paragraph 21

This result is variously known as Matiyasevich's theorem ( because he provided the crucial step that completed the proof ) and the MRDP theorem ( for Yuri Matiyasevich, Julia Robinson, Martin Davis, and Hilary Putnam ).

Because there exists a recursively enumerable set that is not computable, the unsolvability of Hilbert's tenth problem is an immediate consequence.

In fact, more can be said: there is a polynomial