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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f738571d908
DTSTART;TZID=America/Toronto:20260119T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260119T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-162
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MICHAEL GREGORY  UNIVERSITY OF WATERLOO\,\n\n_Computability Re
 lative to Random Sets (2)_\n\nNow that we have covered the required backgr
 ound\, we begin discussion\non 1-random sets and how randomness interacts 
 with computable\nreducibility. Several fundamental results are discussed i
 ncluding\nKučera's Theorem which states that if a 1 random set is Turing\
 nreducible to a c.e. Set\, then that set is Turing Equivalent to 0'. We\nt
 hen cover the Space Lemma which is used in the proof of Kučera\nGác's Th
 eorem which establishes that every set is weak truth-table\nreducible to a
  1-random set.\n\nMC 5403
DTSTAMP:20260503T115815Z
END:VEVENT
END:VCALENDAR