Date/Time Date(s) - 21/11/202512:30 pm - 1:30 pm
Speaker: Jananan Arulseelan (Iowa State University)
Location: Hamilton Hall, Room 410
Title: Computability and Sherman’s S Factor
Abstract: In 2020, Ji, Natarajan, Vidick, Wright and Yuen announced their seminal MIP* = RE result, settling the Connes Embedding Problem in the negative. Shortly after that, Goldbring and Hart isolated the computable continuous logic content of the aforementioned result to show that the universal theory of the hyperfinite II_1 factor is not computable. This yields a vast strengthening of the negative solution to the CEP.