Session 8B - Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Establishes hardness results for Kolmogorov complexity under uniform reductions. Teaches algorithmic information theory and complexity lower bounds.

A 22-minute video from Association for Computing Machinery (ACM): “Session 8B - Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020