+ Reply to Thread
Results 1 to 2 of 2

Thread: Movie : TRAVELING SALESMAN (about the most powerful problem in computer science)

  1. Link to Post #1
    Avalon Member
    Join Date
    5th January 2011
    Posts
    835
    Thanks
    2,378
    Thanked 5,466 times in 762 posts

    Default Movie : TRAVELING SALESMAN (about the most powerful problem in computer science)

    MOVIE : TRAVELING SALESMAN ... 2012 ... 1:20 MINS

    http://putlockers-9.com/travelling-salesman/

    Four mathematicians are hired by the US government to solve the most powerful problem in computer science history.

    4 Mathematicians solve the problem P=NP ... P versus NP problem -

    The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.

    Govt has it's own idea what to do with it, and it begins .

  2. The Following 6 Users Say Thank You to ramus For This Post:

    DeDukshyn (12th July 2017), gaiagirl (15th July 2017), Lifebringer (14th July 2017), Mike (13th July 2017), Nasu (12th July 2017), Noelle (13th July 2017)

  3. Link to Post #2
    UK Avalon Founder Bill Ryan's Avatar
    Join Date
    7th February 2010
    Location
    Ecuador
    Posts
    34,268
    Thanks
    208,959
    Thanked 457,523 times in 32,788 posts

    Default Re: Movie : TRAVELING SALESMAN (about the most powerful problem in computer science)

    Let me try to help out!

    From Wikipedia (because I can't do any better myself)
    ~~~

    Travelling Salesman is a 2012 intellectual thriller film about four mathematicians solving 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 mathematical problems that are thought to be hard; 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.

    Since many cryptographic schemes rely on the difficulty of factoring integers to protect their data, this would allow access to private data like personal correspondence, bank accounts and, possibly, government secrets.

    The 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.

  4. The Following 6 Users Say Thank You to Bill Ryan For This Post:

    DeDukshyn (12th July 2017), fourty-two (14th July 2017), gaiagirl (15th July 2017), Lifebringer (14th July 2017), Mike (13th July 2017), ramus (14th July 2017)

+ Reply to Thread

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts