BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Kolmogorov Complexity and Gödel’s Incompleteness Theorems - Shu
 bham Aggarwal\, Churchill College
DTSTART:20180207T193000Z
DTEND:20180207T200000Z
UID:TALK100945@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:The Kolmogorov complexity of a string is defined as the length
  of the smallest program which outputs it. It encapsulates the ideas of ra
 ndomness and compressibility of data and is a standard concept used in Inf
 ormation Theory. Surprisingly\, it can also be used to give elegant proofs
  of some classical results in mathematical logic and computability.\n\nThi
 s talk will first give an overview of Kolmogorov Complexity and then use i
 t to prove some simple results. It will then present proof sketches for bo
 th of Gödel’s incomplete theorems using these notions.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR