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:69f9072f4c908
DTSTART;TZID=America/Toronto:20250916T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250916T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-153
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:COLE WYETH\, UNIVERSITY OF WATERLOO\n\n_Introduction to Algorit
 hmic Complexity_\n\nThe Kolmogorov complexity of an object is the size of 
 the smallest\n\"self-extracting archive\" that could have generated it\, w
 hich can be\nviewed as an algorithmic information content. For instance\, 
 an image\nof the Mandelbrot set (to finite resolution) may appear quite vi
 sually\ncomplex\, but is actually rather algorithmically simple since it\n
 requires only a short rule and iteration number to generate it\, while\nty
 pical noise is algorithmically complex. In this introductory talk\, I\nwil
 l introduce the plain and prefix versions of the Kolmogorov\ncomplexity al
 ong with some of their basic properties such as\n(in)computability level.\
 n\nMC 5403
DTSTAMP:20260504T205303Z
END:VEVENT
END:VCALENDAR