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:6a2397514f935
DTSTART;TZID=America/Toronto:20151007T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20151007T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-14
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MOHAMMAD MAHMOUD\, PURE MATHEMATICS\, UNIVERSITY OF WATERLOO\n\
 n\"Algorithmic Randomness: Introduction to Kolmogorov Complexity\"\n\nAfte
 r we have established the machine existence (Kraft-Chaitin\nTheorem)\, thi
 s time we are going to give the proofs for the following\n\"desirable\" fa
 cts about $K$ which we stated before: (a) Incompressible\n(in the sense of
  $K$) strings have only short runs of zeros (i.e.\nblocks only consisting 
 of zeros)\, and (b) Zeros and ones occur\nbalancedly. \nMC 5403
DTSTAMP:20260606T034313Z
END:VEVENT
END:VCALENDAR