Google Play icon

Can there be an algorithm for every human desire?

Share
Posted March 26, 2013

Golden-Ticket[1]

The travelling salesman problem still defies the most powerful computers (Image: Quentin Bertoux/Agence Vu)

Lance Fortnow shows how an esoteric mathematical problem has deep implications for our future in The Golden Ticket: P, NP, and the search for the impossible.

It seems as if computers can do almost anything. Serve up the world’s knowledge in an instant? No problem. Simulate a human brain? Working on it.

But are there some tasks that computers will never be able to perform, no matter how powerful they become? This question forms the basis of one of the most important problems in computer science and mathematics, known by the esoteric name: P versus NP.

The definition of this problem is tricky and technical, but in The Golden Ticket, Lance Fortnow cleverly sidesteps the issue with a boiled-down version. P is the collection of problems we can solve quickly, NP is the collection of problems we would like to solve. If P = NP, computers can answer all the questions we pose and our world is changed forever.

Read more at: NewScientist.com

Featured news from related categories:

Technology Org App
Google Play icon
85,377 science & technology articles

Most Popular Articles

  1. New treatment may reverse celiac disease (October 22, 2019)
  2. "Helical Engine" Proposed by NASA Engineer could Reach 99% the Speed of Light. But could it, really? (October 17, 2019)
  3. New Class of Painkillers Offers all the Benefits of Opioids, Minus the Side Effects and Addictiveness (October 16, 2019)
  4. The World's Energy Storage Powerhouse (November 1, 2019)
  5. Plastic waste may be headed for the microwave (October 18, 2019)

Follow us

Facebook   Twitter   Pinterest   Tumblr   RSS   Newsletter via Email