Intersection of Turing-recognizable language and regular language True or false:
An intersection of a Turing-recognizable and a regular language is always Turing-decidable.

This was asked on a practice test and the answer is False. Why? I thought regular languages were a subset of decidable languages. So if you intersect regular and recognizable the result would also have to be a subset of decidable.

Is that not correct?
A recognizable language is not necessarily decidable. If you intersect such a language with $\Sigma^*$ it doesn't suddenly become decidable.