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:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f78e34d05db
DTSTART;TZID=America/Toronto:20251021T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251021T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-156
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JULIAN CHENG\, UNIVERSITY OF WATERLOO\n\n_An Introduction to Ra
 ndom Binary Sequences_\n\nIn this week\, our goal is to cover two definiti
 ons of what it means\nfor an infinite binary sequence to be random: one de
 finition will come\nfrom the perspective of computability and the other fr
 om measure\ntheory. We will show that they are equivalent. As an example\,
  we\nwill show that Chaitin's constant (also known as the halting\nprobab
 ility) is random. This will cover parts of section 6.1 and 6.2\nfrom Downe
 y and Hirschfeldt.\n\nMC 5403
DTSTAMP:20260503T180436Z
END:VEVENT
END:VCALENDAR