We all tackle hard problems everyday, like finding a parking spot in the Dan Allen Deck. However, there are special types of problems which are hard even for a computer to solve. Reductions, conversions of one problem into another, play a critical role in determining the hardness of these computational problems, and lead to philosophical questions about what human actions are actually hard. Technical enough to be interesting and tangible enough to quickly understand, reductions are a fun way to play with a theoretical computer science concept. Our examples will largely be mathematical and the talk should be accessible to all undergraduates.