The movie revolves around perhaps the greatest problem in computer science P vs. NP. Most things we rely on in the world, assume that P is not equal to NP -- that creating a code is way easier than cracking it, that figuring out whether a cure for cancer is effective is way easier than finding the cure in the first place. Traveling Salesman doesn't analyze the problem. Instead, it asks, what if P == NP? In other words, what if codes are just as easy to crack as they are to create? What if finding a cure for cancer is just as easy as showing a cure you've found works. Most scientists today don't believe this is true, but it has not yet been proved, which makes for an interesting, what if it's true discussion.
The dialog is good, exploring the ramifications of a P == NP world. Somehow, it left me wanting more.
The dialog is good, exploring the ramifications of a P == NP world. Somehow, it left me wanting more.