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:69f319862a3ed
DTSTART;TZID=America/Toronto:20260323T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260323T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-167
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:WILLIAM DAN\, UNIVERSITY OF WATERLOO\n\n_Solovay Reducibility a
 nd Relative Randomness_\n\nHaving completed our characterization of left-c
 .e. random reals\, we\nreturn to the concept of Solovay reducibilityto stu
 dy it more deeply.\nWe will see that beyond the characterizations we have 
 seen so far\,\nSolovay reducibilitycan be viewed as a measure of relative 
 randomness\,\nand connect this perspective back to the Kucera-Slamantheore
 m. We will\nalso relate it to the reducibilities we have studied previousl
 y\, and\ngive a final\, possiblysimplest\, characterization of Solovay\nre
 ducibility. This seminar follows sections 9.1 and 9.2 from the\nDowneyand 
 Hirschfeldt book.\n\nMC 5403
DTSTAMP:20260430T085742Z
END:VEVENT
END:VCALENDAR