Travelling Salesman

२०१२ • ८० मिनिटे

३.८

२५ परीक्षण

61%

टोमॅटोमीटर

पात्र

वेब ब्राउझरवर किंवा सपोर्ट असलेल्या डिव्हाइसवर पहा अधिक जाणून घ्या

तुमच्या भाषेत ऑडिओ किंवा उपशीर्षके उपलब्ध नाहीत. उपशीर्षके इंग्रजी मध्ये उपलब्ध आहेत.

या चित्रपटाविषयी

Four of the world's smartest mathematicians are hired by the U.S. government to solve the most elusive problem in computer science history—P vs. NP. The four have jointly created a "system" which could be the next major advancement for humanity or the downfall of society. As the mathematicians are about to sign documents that will give the government sole and private ownership of their solution, they wrestle with the moral dilemma of how their landmark discovery will be used.

रेटिंग आणि पुनरावलोकने

३.८

२५ परीक्षणे

Malachi de Ælfweald

२७ मे, २०१५

Show would have been better if they weren't just sitting around a table the whole time. Audio playback repeatedly cut out, so be ready to turn CC on if you want to know what is being said.

हा चित्रपट रेट करा

तुम्हाला काय वाटते ते आम्हाला सांगा.