It doesn’t take much for conditional probability to get complicated. But during my talk, we’re going to make it even more complicated than it needs to be. Next week, we will start by discussing a more traditional curve-ball in the probability playbook: the Monty Hall problem. Then, we will move on to a more modern conundrum: the Sleeping Beauty paradox. Finally, we’ll take a deep dive into some of the deeper mathematics behind these issues, discussing the equations for Borel-type paradoxes and Kac-Slepian type paradoxes. Some of it will be fun, some of it will be calculus, and all of it will be interesting. Hope to see you there!