Answers are grounded in this paper and cite their sources.
We show that the universal theory of the hyperfinite II ₁ factor is not computable. The proof uses the recent result that MIP*=RE. Combined with an earlier observation of the authors, this yields a proof that the Connes Embedding Problem has a negative solution that avoids the equivalences with Kirchberg’s QWEP Conjecture and Tsirelson’s Problem.
No takes yet. Share an insight, caveat, or question.
Goldbring et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: