A complexity theoretic resolution of Connes’ Embedding Conjecture


This is a serious paper by serious mathematicians working in computer science departments. One way to view the result is that it uses complexity theoretic techniques to make a recursive presentation for a C^* algebra that is nasty enough to be a counterexample to Connes. In order to understand properties of the algebra they use the language of quantum nonlocal games.

submitted by /u/khanh93
[link] [comments]

Published by

Nevin Manimala

Nevin Manimala is interested in blogging and finding new blogs https://nevinmanimala.com

Leave a Reply

Your email address will not be published. Required fields are marked *