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:20120311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20111106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a22146fce9f6
DTSTART;TZID=America/Toronto:20120620T154000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120620T154000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-conidis-jun-20-2012
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 50
 46 Waterloo ON N2L 3G1 Canada
SUMMARY:Computability learning seminar
CLASS:PUBLIC
DESCRIPTION:CHRIS CONIDIS\, PURE MATHEMATICS DEPARTMENT\, UNIVERSITY OF WAT
 ERLOO\n\n\"THE COMPLEXITY OF ASCENDANT SEQUENCES IN LOCALLY NILPOTENT GROU
 PS -\nPART II\"\n\nWe will give a computably enumerable construction of as
 cendant\nsequences in locally nilpotent groups via P. Hall's Collection Pr
 ocess\nfor nilpotent groups.
DTSTAMP:20260605T001231Z
END:VEVENT
END:VCALENDAR