Let $A = \{\langle M\rangle | M $ is a Turing Machine and $L(M)=\emptyset\}$ .  
We want to write a Turing machine R that Decides(I don't mean Recognizes) the language A.