It looks like you're using an Ad Blocker.

Please white-list or disable AboveTopSecret.com in your ad-blocking tool.

Thank you.

 

Some features of ATS will be disabled while you continue to use an ad-blocker.

 

Computer scientist Vinay Deolalikar claims to have solved maths riddle of P vs NP

page: 1
1

log in

join
share:

posted on Aug, 12 2010 @ 11:48 PM
link   
I came across this article and found it intresting. I am curious what the ramifications will be if this is indeed correct. It reminds me of the movie Sneakers from the 90's - Sneakers

So urce


P vs NP is one of the seven millennium problems set out by the Massachusetts-based Clay Mathematical Institute as being the “most difficult” to solve.

Many mathematical calculations involve checking such a large number of possible solutions that they are beyond the current capability of any computer. However, the answers to some are quick and easy to verify as correct. P vs NP considers if there is a way of arriving at the answers to the calculations more quickly in the first place.



Mods - If this has already been posted please remove. I searched a few different topic setups and did not come across this article.

[edit on 12-8-2010 by Xcathdra]

[edit on 12-8-2010 by Xcathdra]

[edit on 12-8-2010 by Xcathdra]



new topics
 
1

log in

join