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:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20151101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a24879adc8f8
DTSTART;TZID=America/Toronto:20160113T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20160113T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-24
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JONATHAN STEPHENSON\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSI
 TY OF\nWATERLOO \n\n“2-randomness and complexity” \n\nWe will begin ou
 r proof that Z is 2-random if and only infinitely many\nof its initial seg
 ments are incompressible in the sense of plain\ncomplexity.
DTSTAMP:20260606T204826Z
END:VEVENT
END:VCALENDAR