Another step toward quantum computers

TalkBack 1 of 1:

• Thread View
• Flat View

Nice but ...

... I think that more resources should be devoted to research in overcoming the problem of NP completeness. Now, nobody knows if there are algorithms in polynomial time to solve all the NP-complete problems but discovering only one (as you know from your theory class) will automatically make the solution to the others run in polyn. time. Quantum computing will only make run programs, with polyn. time algorithms, incredibly fast and programs with exponential time algorithms faster than ever, but still they will run in exponential time and will work only for "small" cases. Just imagine all the dollars spent in research for quantum computing devoted instead to this! Who knows? Maybe we will find a solution

Posted by: markbn   Posted on: 11/20/06 You are currently: a Guest | Members login | Terms of Use

Alert moderator to an offensive message

Subscribe to this discussion via Email or RSS

SponsoredWhite Papers, Webcasts, and Downloads

• Why Isn't Server Virtualization Saving Us More? A Few Small Changes May Dramatically Increase Your Efficiency VMware Companies have rapidly adopted server virtualization over the past few ... Download Now
• Five Steps to Determine When to Virtualize YourServers VMware Server virtualization isn't just for big companies. Entry-level ... Download Now
• The Impact of Virtualization Software on Operating Environments VMware Today's use of virtualization technology allows IT professionals to ... Download Now