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:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a256d63d9021
DTSTART;TZID=America/Toronto:20170502T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170502T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-69
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MOHAMMAD MAHMOUD\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY 
 OF\nWATERLOO\n\n\"Comparing Structures\"\n\nIn Computability Theory we hav
 e tools to compare the complexities of\nsets of natural numbers\, tools li
 ke: Turing reducibility\, enumeration\nreducibility\, many-one reducibilit
 y\, etc. For structures there are\nalso various ways. For example have Muc
 hnik reducibility\, Medvedev\nreducibility\, effective interpretability (a
 lso known as\n$\\Sigma$-definability)\, and effective bi-interpretability.
  We are\ngoing to talk about Muchnik and Medvedev reducibilities.
DTSTAMP:20260607T130851Z
END:VEVENT
END:VCALENDAR