Let $$R = \{\langle M \rangle \mid L(M) \text{ is decidable}\}.$$ Is $R$ recursively enumerable or co-recursively enumerable?
Complexity of the language of all TMs $M$ such that $L(M)$ is decidable
computability;turing machines;semi decidability