<div>It's refreshing to see that someone attempts to prove a theorem by releasing source-code.</div>
<div> </div>
<div>The question is whether someone can give it a 3-SAT problem it either can't solve or can't solve correctly.<br><br></div>
<div class="gmail_quote">On 21 January 2011 11:29, Simon Johnson <span dir="ltr"><<a href="mailto:simon.johnson@gmail.com">simon.johnson@gmail.com</a>></span> wrote:<br>
<blockquote style="BORDER-LEFT: #ccc 1px solid; MARGIN: 0px 0px 0px 0.8ex; PADDING-LEFT: 1ex" class="gmail_quote">
<div>I've put this on sci.crypt - there are specialists in the field on there.</div>
<div> </div>
<div>I'll see what they have to say!<br><br></div>
<div class="gmail_quote">
<div>
<div></div>
<div class="h5">On 20 January 2011 23:04, Bob Ham <span dir="ltr"><rah@bash.sh></span> wrote:<br></div></div>
<blockquote style="BORDER-LEFT: #ccc 1px solid; MARGIN: 0px 0px 0px 0.8ex; PADDING-LEFT: 1ex" class="gmail_quote">
<div>
<div></div>
<div class="h5">:-)<br><br><a href="http://romvf.wordpress.com/2011/01/19/open-letter/" target="_blank">http://romvf.wordpress.com/2011/01/19/open-letter/</a><br><font color="#888888"><br><br>--<br>Bob Ham <rah@bash.sh><br>
<br>for (;;) { ++pancakes; }<br></font><br></div></div>_______________________________________________<br>Liverpool mailing list<br><a href="mailto:Liverpool@mailman.lug.org.uk" target="_blank">Liverpool@mailman.lug.org.uk</a><br>
<a href="https://mailman.lug.org.uk/mailman/listinfo/liverpool" target="_blank">https://mailman.lug.org.uk/mailman/listinfo/liverpool</a><br></blockquote></div><br></blockquote></div><br>