Complexity of the language of all TMs $M$ such that $L(M)$ is decidable
This set is not r.e. nor co-r.e., in fact it's complete at the 3rd level of the arithmetic hierarchy ($\Sigma^0_3$-complete). This is shown in Soare's textbook.