[Liverpool] P != NP

[Simon Johnson]

http://michaelnielsen.org/polymath1/index.php?title=Deolalikar's_P!%3DNP_paper


On 9 August 2010 21:09, Simon Johnson <simon.johnson at gmail.com> wrote:

> I posted this to sci.crypt a couple of hours ago and Bob Silverman has
> taken a look at the proof.
>
> Most of you won't know Bob, but he's a big mover in crypto circles; he's an
> a very able mathematician.
>
> More importantly, he's an expert in this field and he says, that so far,
> after his fourth reading, the proof holds. It looks like he's going to spend
> some serious effort looking at this anyway.
>
> It will take weeks to years before we're certain that it really is a
> proof.
>
> On 9 August 2010 15:02, Simon Johnson <simon.johnson at gmail.com> wrote:
>
>> I missed it. Thanks very much.
>>
>> If the claims of this paper are verified this is an extremely significant
>> development in complexity theory.
>>
>> It also appears that the paper isn't a "trick proof." Such a proof is one
>> that use a tiny trick to get the result required but gives no real insight
>> in to any issues surrounding the problem.
>>
>> Skimming the paper, it seems that significant understanding of the problem
>> (and why it exists) has been obtained.
>>
>> I, of course, say this as an arm-chair mathematician. :)
>>
>> Simon
>>
>> On 9 August 2010 12:13, Bob Ham <rah at bash.sh> wrote:
>>
>>>  In case anybody missed it..
>>>
>>> http://www.scribd.com/doc/35539144/pnp12pt
>>>
>>> --
>>> Bob Ham <rah at bash.sh>
>>>
>>> for (;;) { ++pancakes; }
>>>
>>> _______________________________________________
>>> Liverpool mailing list
>>> Liverpool at mailman.lug.org.uk
>>> https://mailman.lug.org.uk/mailman/listinfo/liverpool
>>>
>>
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.lug.org.uk/pipermail/liverpool/attachments/20100811/b9e107f1/attachment.htm>