On Mon, Feb 2, 2009 at 4:23 PM, Matthew Brecknell <span dir="ltr"><<a href="mailto:haskell@brecknell.org">haskell@brecknell.org</a>></span> wrote:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Luke Palmer wrote:<br>
> and pick out the ones which denote a total computable function [...]<br>
<br>
How important is totality to this argument? If it is important, how do you decide it?</blockquote><div><br>It is at the very essence of the argument; it is why there are countable sets which are computably uncountable: (nonconstructive) mathematics does not need to decide, only programs need to do that :-)<br>
<br>Luke</div></div>