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:6a221e3ea79ce
DTSTART;TZID=America/Toronto:20120718T154000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120718T154000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-harrison-trainor-jul-18-2012
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 50
 46 Waterloo ON N2L 3G1 Canada
SUMMARY:Computability learning seminar
CLASS:PUBLIC
DESCRIPTION:MATTHEW HARRISON-TRAINOR\, PURE MATHEMATICS\, UNIVERSITY OF WAT
 ERLOO\n\n\"$N$-SYSTEMS\"\n\nMany constructions in computability theory are
  priority  \narguments which build a c.e. set satisfying a list of requir
 ements.  \nThe complexity of such a construction can be measured by the 
  \ncomplexity of seeing how the requirements are satisfied\, for example\
 ,\n \nfinite injury arguments are $\\Delta_2$. We will introduce $n$-syst
 ems\,\n \na general method of formalizing such constructions which is use
 ful  
DTSTAMP:20260605T005422Z
END:VEVENT
END:VCALENDAR