automata – Computational power of a Turing Machine with infinite states


Consider a turing machine with infinite states. This machine is identical to a regular machine. Only that number of states could be infinite.
Does this machine has more computational power than a regular machine ?

If yes – Then show that a machine with infinite states can recognize languages that cannot be recognized with a machine that has a finite number of states… ( and how this doesnt contradict the church turing hypothesis)

If no – show how a machine with a finite number of states could imitate the operation of a machine with an infinite number of states..

The main thing to notice above is that the question is about recognizing a language and not deciding a language.