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:69f4e9b3ee393
DTSTART;TZID=America/Toronto:20260309T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260309T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-166
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:WILLIAM DAN\, UNIVERSITY OF WATERLOO\n\n_Random Left C.E. Reals
  and Solovay Reducibility_\n\nIn the last seminar we discussed how the hal
 ting probability of a\nuniversal prefix-free machine is left c.e. andrando
 m\, and asked if the\nconverse would hold. We then studied Solovay reducib
 ility and the\nresulting concept ofSolovay completeness\, which turns out 
 to be key in\nproving the converse. In this seminar\, we will use thisconc
 ept to\nprove the two theorems giving the converse\, a theorem from Calude
  et\nal. and the Kucera-Slamantheorem. Then\, we will go back to expand\nf
 urther on the properties of Solovay reducibility and how it\nconnectsto re
 lative randomness\, and relate this connection back to the\ntheorems we pr
 oved. This seminar follows sections9.1 and 9.2 from the\nDowney and Hirsch
 feldt book.\n\nMC 5403
DTSTAMP:20260501T175811Z
END:VEVENT
END:VCALENDAR