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:6a1a2c034e7dd
DTSTART;TZID=America/Toronto:20260604T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260604T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-171
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JOEY LAKERDAS-GAYLE\, UNIVERSITY OF WATERLOO\n\n_Priority Argum
 ents on Trees_\n\nWe will introduce terminology for priority trees followi
 ng Steffen\nLempp's notes and compare the classicalpriority argument for S
 acks\nCone Avoidance Theorem with a proof that uses a priority tree.\n\nMC
  5403
DTSTAMP:20260530T001459Z
END:VEVENT
END:VCALENDAR