On 2010-06-18, Peter Webb <webbfamily@DIESPAMDIEoptusnet.com.au> wrote: > If you can construct a list of all computable numbers (which you > can't), then Cantor's diagonal proof will construct a number not on > the list. And that number is definitely computable, because there is > a simple algorithm for producing it. Take the nth digit of the nth > item on the list
That requires having the list be computable or provided as input, neither of which is assumed or proven.
Rest snipped as it is based on your false premise.
