[Liverpool] P != NP

[Simon Johnson]

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/20100809/5e3477c2/attachment.htm>