Consider an automaton with a countably infinite number of states. This machine could, given it's current state and a symbol from the input alphabet, move to another arbitrary state in a finite amount of time.
What would the computational power of such an (obviously not physically realizable) device?
In particular, could it compute any function computable by a Turing Machine? Could it even solve the halting problem for a Turing Machine?