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:69f891bd5d28f
DTSTART;TZID=America/Toronto:20260112T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260112T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-161
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MICHAEL GREGORY\, UNIVERSITY OF WATERLOO\n\n_Computability Rela
 tive to Random Sets_\n\nThis presentation explores the interaction between
  algorithmic\nrandomness and Turing degrees. We focus on 1-random sets and
  how\nrandomness interacts with computable reducibility. Several\nfundame
 ntal results are discussed that illuminate the placement of\nrandom sets w
 ithin the Turing degrees and the constraints that\nrandomness imposes on c
 omputable reductions. In particular\, the\nKucera-Gacs Theorem is presen
 ted\, which establishes that every set is\nweak truth-table reducible to a
  1-random set.\n\nMC 5403
DTSTAMP:20260504T123157Z
END:VEVENT
END:VCALENDAR