In a class on Turing machines, the lecturer said that the language for a machine with 100 states is both recognizable and decidable. How can we infer this just from the number of states in the machine?
Turing machines with a finite number of states
automata