Travelling Salesman

Travelling Salesman (2012)

Four mathematicians are gathered and meet with a top official of the United States Department of Defense. After some discussion, the group agrees that they must be wary with whom to trust and control their solution. The official offers them a reward of $10 million in exchange for their portion of the algorithm, swaying them by attempting to address their concerns. Only one of the four speaks out against the sale, and in doing so is forced to reveal a dark truth about his portion of the solution. Before they sign a license to the government, however, they wrestle with the ethical consequences of their discovery. -- Wikipedia

개봉일
2012-06-16
TMDB
5.5 / 10 (38)
상영 시간(분)
1시간 20분
장르
드라마, 미스터리
감독
Timothy Lanzone

출연진

흥미로운 사실

Travelling Salesman is a 2012 intellectual thriller film about four mathematicians who solve the P versus NP problem, one of the most challenging mathematical problems in history. The title refers to the travelling salesman problem, an optimization problem that acts like a key to solving other difficult mathematical problems. It has been proven that a quick travelling salesman algorithm, if one exists, could be converted into quick algorithms for many other difficult tasks, such as factoring large numbers.

위키백과에서 더 읽기 · 텍스트 출처: 위키백과, CC BY-SA 4.0. 데이터 출처: Wikidata.

추천