I could do a quick talk (but I'd have to prepare it really quickly) on the theoretical limits of computation.<br><br>A brief outline:<br><ul><li>Introduction<br></li><li>The incomputability of the reals</li><ul><li>Cantor's theory of transfinite sets.<br>
</li></ul><ul><li>Proof that 100% of the reals are incomputable. (this is likely to be the most time consuming bit, but it is probably the most interesting bit of any talk.)<br></li></ul><ul><li>Weakly incomputable reals.</li>
<ul><li>Square Root of 2.</li></ul><li>Strongly incomputable reals.</li><ul><li>The probability that a random Python program halts.<br></li></ul></ul><li>P vs NP</li><li>The halting problem. <br></li><li>The busy beaver sequence.</li>
</ul><br>If there's sufficient interest, I can whip something up before Wednesday. It gives me another change to enhance my public speaking skills :)<br><br>Bear in mind that I am not an expert in this topic so coming to this talk may in fact make you <i>dumber</i> than you were before. But hey, we're just a LUG not a a research institute.<br>
<br>Simon.<br><br>