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:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20141102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dfe20600b56
DTSTART;TZID=America/Toronto:20150930T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20150930T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-13
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:Mohammad Mahmoud\, Pure Mathematics\, University of Waterloo\n\
 n\"Algorithmic Randomness: Introduction to Kolmogorov Complexity\"\n\nLast
  time we saw why the Kolmogorov complexity $K$ can be better than\nthe pla
 in complexity $C$ as it is subadditive and complexity doesn't\ndip. This t
 ime we are going to see more properties showing that $K$\nmatches our intu
 ition. More precisely\, (a) Incompressible (in the\nsense of $K$) strings 
 have only short runs of zeros (i.e. blocks only\nconsisting of zeros)\, an
 d (b) Zeros and ones occur balancedly.\n\nMC 5403
DTSTAMP:20260415T190750Z
END:VEVENT
END:VCALENDAR