Self doubt

Question

L={ <TM>| L(TM)= not re} is it decidable or not if undecidable what specific  set it belongs ?

Comments

Thanks but if I modify and say L={ <TM> | L(TM)=RE}

---

@Somoshree Datta 5

isn't L={ <TM>| L(TM)= not re} a trivial property?

None of the tuning machine satisfy the property hence trivial and by RICE's first theorem it should be decidable. means it should be recursive.

---

oh..yes..totally missed this out.! thanks :)

---

@Somoshree Datta 5

L={ <TM>| L(TM)=  re} is also trivial. meaning its also decidable.

---

yes..