Turing machines with a finite number of states
You misunderstood your lecturer's claim. Their claim was that the language of descriptions of Turing machines with 100 states is decidable. The language accepted by each such machine need not be.

In other words, given a string, you can decide whether it describes a Turing machine having 100 states. That's the extent of the claim.