I would like to determine if the following language is decidable or not. L = { w $\in$ $\Sigma^*$ | $T(M_w)$ is recognized by a Turing machine with at most 42 states}.
I know that every finite language is decidable, but I am not sure if this has anything to do with this particular problem.
Every help is appreciated, I am a little lost.
Thank you