Consider the following two arguments 

> "*For every deterministic TM M1 there exists an **equivalent**
> deterministic machine M2 recognizing the same language.*"    
> "***Equivalence** of two Turing Machines is undecidable*"

These two arguments seem a bit contradicting to me.
What should I conclude from these two arguments?