COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM

Abstract The Connes Embedding Problem (CEP) asks whether every separable II 1 factor embeds into an ultrapower of the hyperfinite II 1 factor. We show that the CEP is equivalent to the statement that every type II 1 tracial von Neumann algebra has a computable universal theory.