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:69f703b11591c
DTSTART;TZID=America/Toronto:20250923T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250923T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-154
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:COLE WYETH\, UNIVERSITY OF WATERLOO\n\n_Introduction to Prefix-
 free Kolmogorov Complexity_\n\nI will continue last week's introduction to
  algorithmic complexity by\nupgrading from the plain Kolmogorov complexity
  to the prefix-free\nKolmogorov complexity\, which offers a more effective
  explanation of\neffective explanations. This alternative formalization of
  algorithmic\ncomplexity can be motivated in terms of probabilistic progra
 ms with\n\"random seeds.\" I will explain why the probabilistic  approach
  might\nbe considered heretical (by Kolmogorov)\, and prove some slightly 
 more\nsophisticated properties of the prefix-free Kolmogorov complexity. A
 s\ntime permits\, I will also define its conditional version\, which has\n
 been used to construct the information distance and its practical\ncounter
 part\, the normalized compression distance\, which was applied to\nbioninf
 ormatics by my advisor Professor Ming Li. \n\nMC 5403
DTSTAMP:20260503T081337Z
END:VEVENT
END:VCALENDAR