BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260514T200128EDT-8195UoJvzM@132.216.98.100
DTSTAMP:20260515T000128Z
DESCRIPTION:Title: Benchmarking the Borel Complexity of Classical Problems
 \n\nAbstract: Many problem in mathematics involve solutions that cannot be
  explicitly stated. \emph{Borel Reductions} are a method for comparing the
  inherent difficulty of apparently unrelated problems. This talk gives bas
 ic definitions and their motivation and illustrates with examples includin
 g recent theorems of Sabok and others.\n
DTSTART:20250325T153000Z
DTEND:20250325T163000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Matthew Foreman (UC Irvine)
URL:https://www.mcgill.ca/mathstat/channels/event/matthew-foreman-uc-irvine
 -364439
END:VEVENT
END:VCALENDAR