Quote: Originally posted by TheHeadFL
KornNut- Yes, I have read Digital Fortress by Dan Brown, good book. Its interesting that you mention NP completeness, since that is also really interesting. If they could prove that prime number factorization was a problem that was in P, then thousands of other problems associated with it would be in P as well. Just imagine if they could prove the halting problem was in P! | IF some one actually found a good algorithm, I would hope they would be honest, otherwise they can rape every one's credit card online.
__________________
3.0 GHz P4 w/ Hyper Threading
1 Gig DDR RAM
9800 Pro ATI Radeon
7.1 Soundblaster
DVD Burners are a must!
19\'\' Samsung LCD
______________________________
In this world gone mad, we won\'t spank the monkey. The monkey will spank us! |