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:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20151101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a22f97d64b72
DTSTART;TZID=America/Toronto:20160615T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20160615T100000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-37
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JONATHAN STEPHENSON\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSI
 TY OF\nWATERLOO \n\n“The Decanter Method (III)” \n\nLast week we saw h
 ow to prove that a K-trivial real cannot be Turing\ncomplete\, but we made
  several simplifying assumptions that set\nconstants equal to zero. \n\nTh
 is week\, we will show how to modify the construction we used to make\nit 
 work when the constants are allowed to take on arbitrary values.
DTSTAMP:20260605T162949Z
END:VEVENT
END:VCALENDAR