On Mon, Feb 2, 2009 at 4:23 PM, Matthew Brecknell <hask...@brecknell.org>wrote:
> Luke Palmer wrote: > > and pick out the ones which denote a total computable function [...] > > How important is totality to this argument? If it is important, how do you > decide it? 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 :-) Luke
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
