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:6aa9b4b4f007c
DTSTART;TZID=America/Toronto:20260917T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260917T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-joey-lakerdas-gayle-game
SUMMARY:Computability Learning Seminar | Joey Lakerdas-Gayle | The Game\nMe
 tatheorem
CLASS:PUBLIC
DESCRIPTION:JOEY LAKERDAS-GAYLE (UNIVERSITY OF WATERLOO) \n\n_The Game Meta
 theorem_ \nThe Game Metatheorem is a framework for constructing computable
 \nstructures as a game between players using noncomputable\n\\(\\Delta^0_\
 \eta\\) information for a transfinite ordinal \\(\\eta\\). We\nwill introd
 uce the Game Metatheorem following Montalbán's second\ncomputable structu
 re theory book\, and use it to prove the pairs of\nstructures theorem. \nM
 C 5301
DTSTAMP:20260915T211221Z
END:VEVENT
END:VCALENDAR