The problem of recognizing the unknot is a rare mathematical problem because it can be explained in 30 seconds, yet 150 years after it was first understood as a serious mathematical problem it is still unclear whether a polynomial-time algorithm exists. We will review the literature, discuss how it was proved that the problem is both NP and co-NP, and discuss present efforts to find a polynomial-time algorithm.