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:6a223a9a3cb7b
DTSTART;TZID=America/Toronto:20120808T154000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120808T154000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-harrison-trainor-aug-08-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 WATER
 LOO\n\n“PAIRS OF COMPUTABLE STRUCTURES”\n\nLet A and B be two structur
 es over the same language. We consider the\nquestion of which sets S can b
 e coded by those structures as follows:\nthere is a uniformly computable s
 equence of structures (Cn)n ∈ ω\nsuch that Cn is isomorphic to A if n 
 ∈ S and to B otherwise.
DTSTAMP:20260605T025522Z
END:VEVENT
END:VCALENDAR