I came across the below statement in the classic text “Introduction to Automata Theory, Languages, and Computation” by Hopcroft, Ullman, Motwani.
All problems about Turing machines that involve only the language that the TM accepts are undecidable
They say that the above theorem is per Rice theorem which states that:
“Every nontrivial property of the RE languages is undecidable.”
How are these two statements equivalent? The former deals only problems while the later deals with non trivial property.