Mathematical Conversations

In this talk, I’ll describe one of the most surprising algorithms in computer science: a way to count arbitrarily high while maintaining just three bits of state and a clock. It turns out that the main idea behind the algorithm also appears in a classic physical puzzle about hanging paintings. I will provide each audience member with a version of this puzzle to try solving on their own. No background assumed!