Given a r.e. (recursively enumerable) language, L, how many Turing machines semi-decide L?
You are correct. 

One can always add redundant states to obtain different Turing machines deciding (or semi deciding) the same language. This yields countably infinite Turing machines deciding $L$ (for any decidable $L\subseteq \Sigma^*)$.