Determine if the language is $R$
comments summary:

The language $L$ is decidable.

Hint:


   $L$ is in fact empty! It contains all the machines that decide the halting problem. But, the halting problem is undecidable => there are no machines that decide it.