What is...Kolmogorov complexity?

preview_player
Показать описание
Their contribution is gratefully acknowledged.

Goal.
I would like to tell you a bit about my favorite theorems, ideas or concepts in mathematics and why I like them so much.

This time.
What is...Kolmogorov complexity? Or: Shakespeare’s work is not random.

Disclaimer.
Nobody is perfect, and I might have said something silly. If there is any doubt, then please check the references.

Slides.

Infinite monkey theorem.

Kolmogorov complexity.

Algorithmic probability.

MathGen.

The Library of Babel.

Mathematica.

Pictures used.

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

Someone sorting monkeys work:
-Garbage *toss away*
-Garbage *toss away*
-Bee movie script *toss away*
-Garbage *toss away*
-Yeah! First 12 leters of shakespeere correct!

sledzik
Автор

This is very cool, thanks for showing my code and Mathematica demonstration. I think you should have given proper credit to the author, me, Hector Zenil, as per the license requirements of use and reuse. I think it is only fair, wouldn’t you agree? Not enough just to have added a link down a super long list of relevant and irrelevant references to the video comment, when it is the most prominent content you are using for this video and explanation. Thanks

HectorZenil