The Matiyasevich-Robinson-Davis-Putnam theorem identifies recursively enumerable sets with sets admitting Diophantine representations. It is the bridge between integer polynomial equations and computability theory, and it yields the undecidability of Hilbert tenth problem.