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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a23d085d08c1
DTSTART;TZID=America/Toronto:20210120T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210120T140000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-117
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:LUKE MACLEAN\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY OF W
 ATERLOO\n\n\"Algorithmic Randomness and Complexity\"\n\nWe begin a new ser
 ies of talks exploring the concept of what it means\nfor mathematical obje
 cts (encoded as binary sequences) to be random.\nThis relates strongly to 
 Computability Theory\, and so to make the\ntalks accessible to all who are
  interested\, a brief introduction to\nComputability will be given.
DTSTAMP:20260606T074717Z
END:VEVENT
END:VCALENDAR