[Liverpool] P == NP

[Simon Johnson]

It's refreshing to see that someone attempts to prove a theorem by releasing
source-code.

The question is whether someone can give it a 3-SAT problem it either can't
solve or can't solve correctly.

On 21 January 2011 11:29, Simon Johnson <simon.johnson at gmail.com> wrote:

> I've put this on sci.crypt - there are specialists in the field on there.
>
> I'll see what they have to say!
>
>   On 20 January 2011 23:04, Bob Ham <rah at bash.sh> wrote:
>
>>  :-)
>>
>> http://romvf.wordpress.com/2011/01/19/open-letter/
>>
>>
>> --
>> 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/20110121/1a4ee264/attachment.htm>