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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a2409ee8dee4
DTSTART;TZID=America/Toronto:20200303T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200303T140000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-115
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:Luke MacLean\, Department of Pure Mathematics\, University of W
 aterloo\n\n\"Kleene's $\\mathcal{O}$\"\n\nKleene's $\\mathcal{O}$ is a sys
 tem for ordinal notation used in\ncomputability theory that relates the co
 ncepts of constructive and\ncomputable ordinals. This notation allows one 
 to unambiguously perform\ntransfinite induction on ordinals by ensuring th
 at there is a unique\nrepresentation for each ordinal.\n\nWe will prove so
 me properties about the notation system and show that\nthere are ordinals 
 which are not computable.\n\nMC 5413
DTSTAMP:20260606T115214Z
END:VEVENT
END:VCALENDAR