Recognizer to check if the language of a Turing machine contains a finite subset
Yes, it is sufficient. 

$\langle M \rangle \in L \Longleftrightarrow B\subseteq L(M) \Longleftrightarrow M\text{ accepts all strings in }B \Longleftrightarrow M\text{ accepts }123$.