Can a Turing Machine have infinite accept states?
In the standard Turing machine, the set of states $Q$ is finite $|Q| &lt; \infty$. Therefore, it cannot have infinite final states. However, it may, or may not have multiple final states. This will not change the power of the machine (i.e., one final state is equivalent to $k$ final states).