"Tim Little" <firstname.lastname@example.org> wrote in message news:email@example.com... > On 2010-06-18, Peter Webb <webbfamily@DIESPAMDIEoptusnet.com.au> wrote: >> The diagoinal number is clearly computable. There is a very simple >> algorithm >> for generating it, and this algorithm is easily implemented in a Turing >> Machine. > > Only if you presuppose that the list is initially encoded on the tape > of the Turing Machine.
No, I just assume that the list is given to me first, and I can use that list to define/calculate the missing number. That is exactly the same proviso as used in Cantor's proof that you cannot form a list of all Real numbers.
> No such proviso is made in the definition of > computable number: it must start from a blank tape. > > The rest of your post is based on your false premise and so snipped. > > > - Tim