BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250701T194734EDT-42926zzBFM@132.216.98.100
DTSTAMP:20250701T234734Z
DESCRIPTION:Completeness of the isomorphism problem for separable C*-algebr
 as\nAbstract:In logic and computer science one often studies the complexit
 y of decision problems. In mathematical logic this leads to the program of
  study of relative complexity of isomorphism problems and determining vari
 ous complexity classes. Broadly speaking\, a problem p in a class C is com
 plete in C if any other problem in C reduces to p. The isomorphism problem
  for separable C*-algebras has been studied since the 1960's and evolved i
 nto the Elliott program that classifies C*-algebras via their K-theoretic 
 invariants. During the talk I will discuss the complexity of the isomorphi
 sm problem for separable C*-algebras and its completeness in the class of 
 orbit equivalence relations.
DTSTART:20181130T210000Z
DTEND:20181130T220000Z
LOCATION:BURN 1104\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Marcin Sabok\, 9IÖÆ×÷³§Ãâ·Ñ
URL:/mathstat/channels/event/marcin-sabok-mcgill-unive
 rsity-292027
END:VEVENT
END:VCALENDAR