Kolmogorov complexity and compression arguments

preview_player
Показать описание
Often some existence results can be proven by showing that objects that do not have the required property, can be compressed (and not all objects can!). We will try to illustrate this type of argument with several examples -- both classical ones (e.g., a toy proof of the existence of infinitely many primes, the law of large numbers) and more recent ones (some versions of Lovasz local lemma or related results).

Speaker: Alexander Shen, Montpellier University.

Рекомендации по теме
Комментарии
Автор

He always talks about very interesting problems related to Kolmogorov complexity

GuillermoValleCosmos
Автор

Because you can have your complexity of choice named after you, because science!

Yatukih_
Автор

Да, тяжело на английском читать, наверное.

DiamondSane