This seems not quite right to me. A Turing machine may always halt, but with time depending on its input size. The input can be arbitrarily large, so there's no finite bound on the state space.
This is analogous to putting more memory in your computer when you have a problem that doesn't fit.