Re: Another claim for P=NP

From: John P. Green (foo_at_bar.com)
Date: 10/21/04

  • Next message: Alex Vinokur: "Re: Turing Machine with faults, failures and recovery" 
    Date: Thu, 21 Oct 2004 05:13:47 GMT

    "Alex Hunsley" <lard@tardis.ed.ac.molar.uk> wrote in message
    news:10ncfc8csi6mif1@corp.supernews.com...
    > Eray Ozkural exa wrote:
    > > I'm not sympathetic for claims that P=NP, but here is another one by
    > > Bringsjord and Taylor that a friend referred me to.
    > >
    > > http://kryten.mm.rpi.edu/scb.pnp.solved14.pdf
    >

    Ho hum. Basically they claim that a simple soap film device can solve the
    Steiner tree problem, which is NP-complete, and you can similate the soap
    film
    device digitally. Now despite what might appear in some naive physics text
    book,
    I'm pretty damn sure that on a large Steiner tree problem the soap film
    device will
    find a local minimum, not a global minimum. My dog can find local minima.

  • Next message: Alex Vinokur: "Re: Turing Machine with faults, failures and recovery"