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:6a24696237aaa
DTSTART;TZID=America/Toronto:20160706T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20160706T100000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-40
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:EMILY NEUFELD\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY OF 
 WATERLOO\n\n“A Minimal Pair of K-degrees” \n\nThis week we will have a
  brief interlude and look at a proof for the\nexistence of a minimal pair 
 of K-degrees. This will include proving a\nlemma which states that we can 
 construct a nondecreasing\, unbounded\nfunction which can replace the cons
 tant in our definition of K-\ntriviality\, while still implying K-triviali
 ty.
DTSTAMP:20260606T183930Z
END:VEVENT
END:VCALENDAR