BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The program-size complexity of universal Turing machines - Neary\,
  T (University of Zurich and ETH Zurich)
DTSTART:20120417T160000Z
DTEND:20120417T163000Z
UID:TALK37662@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:2012/04/17
LOCATION:Seminar Room 2\, Newton Institute Gatehouse
END:VEVENT
END:VCALENDAR