In MIP*$=$RE the authors settle the CEP in the negative by showing that two computational complexity classes are equal. But the heart of their argument is the construction of a synchronous game with certain properties. In this talk we will describe the theory of synchronous games, and show how our construction of the algebra of a game leads more directly to the CEP. This approach to the CEP still depends on their construction of a synchronous game with particular properties, but stays within the context of operator algebras and games.