On 2010-06-19, Peter Webb <webbfamily@DIESPAMDIEoptusnet.com.au> wrote: > Of course it is computable. Cantor provides a simple construction > for the number.
Only if the list itself is a recursively enumerable function. Cantor's proof makes no such assumption.