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:6a53b02246b8b
DTSTART;TZID=America/Toronto:20260618T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260618T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-173
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JOEY LAKERDAS-GAYLE\, UNIVERSITY OF WATERLOO\n\n_Sacks' Splitti
 ng Theorem on a tree_\n\nWe will prove Sacks' Splitting Theorem following 
 the method of Steffen\nLempp which uses a dynamically constructed priority
  tree.\n\nMC 5403
DTSTAMP:20260712T151754Z
END:VEVENT
END:VCALENDAR