Campus Event Calendar
Event Entry
What and Who
Applications of Kolmogorov Complexity
Mahmoud Fouz
Graduiertenkolleg
Ringvorlesung
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 21 May 2008
13:00
45 Minutes
Warning: Date has changed!
E1 4
024
Saarbrücken
Warning: New Room!
Abstract
Kolmogorov complexity offers a way to characterize the information
content and intrinsic randomness of an individual object.
Surprisingly, it has found applications in a variety of proofs
including average case analyses, formal languages, combinatorics, time
and space complexity analyses and many more.
I give a brief introduction to the concept of Kolmogorov complexity
and show its usefulness by means of different examples including a
recent application to liar games.
Contact
gk-sek
--email hidden
passcode not visible
logged in users only
gk-sek, 05/20/2008 10:51
gk-sek, 04/21/2008 11:31 -- Created document.
gk-sek, 04/21/2008 11:31 -- Created document.