Matiyasevich just says: for every Turing machine a diophantine equation can be constructed such that the diophantine equation has integer solutions if and only if the Turing machine halts.