Randomness and Kolmogorov Complexity

HomeBooksRandomness and Kolmogorov Complexity
Randomness and Kolmogorov Complexity
Randomness and Kolmogorov Complexity
What does it mean for something to be /”random/”? We might have an intuitive idea for what randomness looks like, but can we be a bit more precise about our definition for what we would consider to be random? It turns out there are multiple definitions for what’s random and what isn’t, but a particularly interesting idea is that of Kolmogorov randomness. Here, we take a look at Kolmogorov randomness (defined in terms of Kolmogorov complexity) to understand what the intuition behind it is and to develop a sense for what it really means for a sequence of values to be random.

0:00 Randomness
1:18 Kolmogorov Complexity
3:52 Kolmogorov Randomness

***

Spanning Tree is an educational video series about computer science and mathematics. See more at https://spanningtree.me

To be notified when a new video is released, sign up for the Spanning Tree mailing list at https://spanningtree.substack.com/

Spanning Tree is created by Brian Yu. https://brianyu.me/

Email me at [email protected] to suggest a future topic.

Take the opportunity to connect and share this video with your friends and family if you find it useful.

No Comments

Leave a Reply

Your email address will not be published. Required fields are marked *