
Re: paper claiming p=np and soap bubbles
Posted:
Jul 8, 2004 2:37 PM


> Basically, the argument is that since soap bubbles can be made to > solve NPcomplete problems, particularly the Steiner tree graph > problem, in what appears to be polynomial time and physics on a > macroscopic level can be modeled as a Turing machine, it must be true > that p=np.
The arguement sidesteps the point of the problem. I can have infinitely many pentiums solve an NP complete problem. That doesn't mean that P=NP.
 Posted via Mailgate.ORG Server  http://www.Mailgate.ORG

