Can there be an algorithm for every human desire?

Share via AddThis
Posted on 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



41,639 science & technology articles

Categories

Our Articles (see all)

General News

Follow us

Facebook   Twitter   Pinterest   StumbleUpon   Plurk
Google+   Tumblr   Delicious   RSS   Newsletter via Email

Featured Video (see all)


Hubble Video Shows Shock Collision inside Black Hole Jet
When you’re blasting though space at more than 98 percent of the speed of light, you may need…

Featured Image (see all)


Orion Windows Undergoing Inspection at Kennedy Space Center
Inside the Neil Armstrong Operations and Checkout Building high bay at NASA’s Kennedy Space Center in Florida, technicians…