BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a272283a3743
DTSTART;TZID=America/Toronto:20260611T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260611T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-172
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:BEINING MU\, UNIVERSITY OF WATERLOO\n\n_Sacks' Splitting Theore
 m_\n\nIn this talk\, I will present Sacks’ Splitting Theorem\, which sta
 tes\nthat every nonzero computably enumerable degree can be split into the
 \njoin of two strictly lower computably enumerable degrees\, as an\nexampl
 e of finite injury priority argument. I will discuss two\ndifferent proofs
  of the theorem\, one of which is the classical way of\nhow people think a
 bout finite injury arguments\, while the other is a\nmodern way of present
 ing a priority argument where a priority tree is\ninvolved.\n\nMC 5403
DTSTAMP:20260608T201355Z
END:VEVENT
END:VCALENDAR