Shannon's source code theorem
Concept
A theorem from information theory (1948) that Cal Newport re-applied to prove lower bounds in contention resolution problems in distributed algorithms, showing the underlying mathematical connections.
Mentioned in 1 video
