Networks and Complexity

Ekaterina (Kat) Fedorova from MIT EECS joins us to discuss strategic learning in recommender systems—what happens when users collectively coordinate to game recommendation algorithms. Kat's research reveals surprising findings: algorithmic "protest movements" can paradoxically he ...  Show more

In this episode, we explore foundational algorithms and data structures that every developer and computer science enthusiast should know. Covering everything from Binary Search Trees (BSTs) to advanced concepts like Dynamic Programming and Greedy Algorithms, this episode is packe ...  Show more

Support the show to get full episodes, full archive, and join the Discord community.

The Transmitter </e ...

Children who are being taught mathematics often balk at the idea of negative numbers, thinking them to be fictional entities, and often only learn later that they are useful for expressing opposite extremes of things, such as considering a debt an amount of money with a negative ...  Show more

There are times in mathematics when we are generalizing the behavior of many different, but similar, entities. One such time that this happens is the use cases of Big O notation, which include describing the long-term behavior of functions, and talking about how accurate numerica ...  Show more