paper claiming p=np and soap bubbles

From: Craig Feinstein (cafeinst_at_msn.com)
Date: 07/07/04 

Date: 7 Jul 2004 09:31:18 -0700

The paper is the best argument I have heard for p=np, even though I
believe the opposite. It can be found here:
http://arxiv.org/abs/cs.CC/0406056
It brings out a great question.

Basically, the argument is that since soap bubbles can be made to
solve NP-complete 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.

What I would like to know from any physicists out there is why do soap
bubbles work in such a way that they are able to solve the Steiner
tree graph problem?How is nature able to quickly solve problems that
we cannot solve quickly?

Craig

Relevant Pages

  • paper claiming p=np and soap bubbles
    ... the argument is that since soap bubbles can be made to ... particularly the Steiner tree graph ... in what appears to be polynomial time and physics on a ...
    (sci.math)
  • paper claiming p=np and soap bubbles
    ... the argument is that since soap bubbles can be made to ... particularly the Steiner tree graph ... in what appears to be polynomial time and physics on a ...
    (sci.physics)
  • Re: paper claiming p=np and soap bubbles
    ... particularly the Steiner tree graph ... in what appears to be polynomial time and physics on a ... Nature has lots of analog computers. ...
    (sci.math)
  • Re: paper claiming p=np and soap bubbles
    ... particularly the Steiner tree graph ... in what appears to be polynomial time and physics on a ... thin as possible... ...
    (comp.theory)
  • Re: paper claiming p=np and soap bubbles
    ... particularly the Steiner tree graph ... in what appears to be polynomial time and physics on a ... thin as possible... ...
    (sci.math)