Communications of the ACM
The Million-Dollar Puzzle That Could Change the World
Neil Immerman, a theoretical computer scientist at the University of Massachusetts Amherst
The single biggest problem in computer science, for which the Clay Mathematics Institute is offering a $1 million prize, is determining whether P equals NP, which raises the issue that computation has a fundamental, innate limitation that goes beyond hardware.
The complexity class of NP, or non-deterministic polynomial time, is comprised of problems whose solutions are difficult to come by but can be confirmed in polynomial time. All problems in the set P also can be found in the set NP, but the core of the P=NP? problem is whether the reverse also applies. If P turns out not to be equal to NP, it demonstrates that some problems are so involved naturally that crunching through them is impossible, and validating this theory would gain insight on the performance of the latest computing hardware, which divides computations across multiple parallel processors, says the University of Massachusetts, Amherst's Neil Immerman.
The field of cryptography also could be affected by this proof, as even the toughest codes would be cracked by a polynomial-time algorithm for solving NP problems. On the other hand, finding an algorithm to solve an NP-complete problem would enable any NP problem to be solved in polynomial time, establishing a universal computable solution. This could support the creation of algorithms that execute near-perfect speech recognition and language translation, and that facilitate computerized visual information processing equal to that of humans.
From New Scientist
View Full Article - May Require Free Registration
Abstracts Copyright © 2011 Information Inc. 
, Bethesda, Maryland, USA
No entries found