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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dd382d30a92
DTSTART;TZID=America/Toronto:20260420T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260420T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-169
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:ELAN ROTH &amp; WILLIAM DAN\, UNIVERSITY OF WATERLOO\n\n_Randomness
  in the Arithmetic Hierarchy_\n\nWe will introduce a problem posed by Bien
 venu\, Csima\, and\nHarrison-Trainor about transforming indices of random 
 left c.e. reals\nto optimal machines with specific halting probabilities. 
 Then\, we will\nprove two results that have been useful in our attempts to
  resolve the\nopen problem.\n\nMC 5403
DTSTAMP:20260413T183837Z
END:VEVENT
END:VCALENDAR