What exactly is the definition of church turing thesis? It's really confusing.
I want to prove the following statement:
A Turing machine with infinitely many states is more powerful than a regular Turing machine, as it can accept all languages.
How does this statement not contradict the Church–Turing thesis?
I don't exactly understand the definition of the Church–Turing thesis, and how it applies in this context.