Intersection of Turing-recognizable language and regular language
A recognizable language is not necessarily decidable. If you intersect such a language with $\Sigma^*$ it doesn't suddenly become decidable.