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:6a6059eb07fe9
DTSTART;TZID=America/Toronto:20260723T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260723T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-joey-lakerdas-gayle-dominant
SUMMARY:Computability Learning Seminar | Joey Lakerdas-Gayle | Dominant\nfu
 nctions and high sets
CLASS:PUBLIC
DESCRIPTION:JOEY LAKERDAS-GAYLE\, UNIVERSITY OF WATERLOO\n\n_Dominant funct
 ions and high sets_\n\nWe prove Martin's theorem that \\(A'\\geq_T\\empty
 set''\\) if and only if\n$A$ computes a function that bounds every total c
 omputable function\nalmost everywhere. Then we will begin discussing the i
 nfinite injury\npriority tree construction of Sacks' theorem that there ex
 ists a high\nincomplete c.e. set.\n\nMC 5403
DTSTAMP:20260722T054931Z
END:VEVENT
END:VCALENDAR