Given a Turing Machine M, are there infinitely many Turing machines that recognize L(M)?
Your attempt is fine. Yes, a Turing machine can only have a finite number of states, but you can add $i$&nbsp;unreachable states for any natural number&nbsp;$i$ and there are infinitely many natural numbers, even though each one of them is finite.