BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Topological arguments in Kolmogorov complexity - Shen\, A (Univers
 it de Montpellier 2)
DTSTART:20120702T130000Z
DTEND:20120702T140000Z
UID:TALK38800@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We show how topological arguments (simple facts about non-homo
 topic mappings) can be used to prove result about Kolmogorov complexity. I
 n particular\, we show that for every string x of complexity at least n +c
  log n one can find a string y such that both conditional complexities C(x
 |y) and C(y|x) are equal to n+O(1).\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR