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:20141102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a23975ad19bc
DTSTART;TZID=America/Toronto:20151014T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20151014T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-15
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JONATHAN STEPHENSON\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSI
 TY OF\nWATERLOO \n\n“Martin-Lf Randomness” \n\nWe will continue last w
 eek’s discussion of prefix-free Kolmogorov\ncomplexity\, but will begin 
 to focus more on infinite sequences. We\nwill discuss what we might mean w
 hen we say that an infinite sequence\nlooks random from an algorithmic per
 spective.
DTSTAMP:20260606T034322Z
END:VEVENT
END:VCALENDAR