Undecidability of the language of all Turing Machines with repeat strings as their language


Show that the language consisting of all Turing machines whose language consists of strings that can be broken up into two consecutive and equal strings is undecidable.

I would prefer if reduction was used and not Rice’s theorem.