MIP*=Re

* There is a protocol by which two entangled provers can convince a polynomial-time verifier of the answer to any computable problem whatsoever (!!), or indeed that a given Turing machine halts.*

I wonder what kind of limitations are posed on such provers (which the article calls "all-powerful").