Author: Russell Reagan
Date: 00:20:37 12/24/04
Go up one level in this thread
On December 22, 2004 at 19:27:58, Dann Corbit wrote: >I don't like software patents (and hence agree with this): >http://swpat.ffii.org/players/knuth/index.en.html "It is not inconceivable that if we took a million of the greatest supercomputers today and set them going, they could compute a certain 300-digit constant that would solve any NP-hard problem by taking the GCD of this constant with an input number, or by some other funny combination." Sounds interesting. What is he talking about here? Is it basically the idea of a very large magic number? Or is it something else? What about the specific case he mentions of using the GCD? How could that (or "some other funny combination") be used to solve NP-hard problems (especially *any* NP-hard problem)?
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.