"In computer science, the Kolmogorov complexity of an object such as a piece of text is a measure of the computational resources needed to specify the object.
More formally, the complexity of a string is the length of the string's shortest description in some fixed description language. The sensitivity of complexity relative to the choice of description language will be discussed. It can be shown that the Kolmogorov complexity of any string cannot be too much larger than the length of the string itself. Strings whose Kolmogorov complexity is small relative to the string's size are not considered to be complex. The notion of Kolmogorov complexity is surprisingly deep and can be used to state and prove impossibility results related to Gödel's incompleteness theorem and Turing's halting problem."
İstanbul Bilgi Üniversitesi, Bilgisayar Bilimleri bölümü tarafından kamuya açık olarak düzenlenen haftalık seminerlerin bu haftaki konusu Kolmogorov Karmaşıklığı, Coşkun Gündüz tarafından sunulacak. 18 Mayıs 2006 Perşembe günü, Dolapdere Kampüsündeki Mahkeme Salonunda saat 17:00'da gerçekleştirilecek konuşmaya ilgilenen herkes davetlidir.
