Gateforum Test Series: Theory of Computation - Turing Machine

Question

anyone please explain this in detail

Comments

https://cs.stackexchange.com/questions/88282/what-is-the-difference-between-undecidable-language-and-turing-recognizable-lang

 

But here it says " It is recognizable but not decidable."

Can someone check this

---

The language isn't decidable, but its recognizable. But why its not a Turing machine?

Here w is a state in M, where TM might fall in a infinite loop. The language in R.E, turing machine should accept it.

---

I think here answer will be Turing recognizable but not decidable.