- #36
matt grime
Science Advisor
Homework Helper
- 9,426
- 6
Ok, let us stop using the word complete as it is evidently causing problems,
do you admit to using the infinty axiom of induction on the finite combinations list to construct and infinite one? how do you do this? you do not provide any method for this construction. what do you mean by the axiom of infinity construction? you do use that phrase, as anyone can check:
https://www.physicsforums.com/archive/topic/10675-1.html
you conclude rightly that no (infinitely) long (enumerable) list can contain all the possibly strings of 0s and 1s.
BUT
you then assert that every combination must be on the list (no new combination is produced, in your words). this contradicts what you've just demonstrated. the only way for this to be true is if indeed the list omitted no elements, but you'd have to prove that - you've not done so, cannot do so, and have in fact proved the negation of that statement. why do you insist that you produce no new element, when clearly you do!
the whole argument rests on the assumption that the new element produced by the diagonal argument is on the list, somewhere off the bottom, like the finite cases.
this is wrong, and just you misusing the diagonal argument one of the simplest proofs there is in mathematics. perhaps its simplicity is what people can't cope with.
you map from the list of 01s sends a string to the binary expansion. this can only work for strings with finitely many non-zero elements, so it cannot possibly contain all the strings! you've not got round this problem either.
i'm not sure how i can put it any more plainly than that.
oh, and telling mathematicians cantor is wrong is a good way for them to not listen to anything else you say. even your own favoured Hilbert thought it was right.
hell, it is right.
do you admit to using the infinty axiom of induction on the finite combinations list to construct and infinite one? how do you do this? you do not provide any method for this construction. what do you mean by the axiom of infinity construction? you do use that phrase, as anyone can check:
https://www.physicsforums.com/archive/topic/10675-1.html
you conclude rightly that no (infinitely) long (enumerable) list can contain all the possibly strings of 0s and 1s.
BUT
you then assert that every combination must be on the list (no new combination is produced, in your words). this contradicts what you've just demonstrated. the only way for this to be true is if indeed the list omitted no elements, but you'd have to prove that - you've not done so, cannot do so, and have in fact proved the negation of that statement. why do you insist that you produce no new element, when clearly you do!
the whole argument rests on the assumption that the new element produced by the diagonal argument is on the list, somewhere off the bottom, like the finite cases.
this is wrong, and just you misusing the diagonal argument one of the simplest proofs there is in mathematics. perhaps its simplicity is what people can't cope with.
you map from the list of 01s sends a string to the binary expansion. this can only work for strings with finitely many non-zero elements, so it cannot possibly contain all the strings! you've not got round this problem either.
i'm not sure how i can put it any more plainly than that.
oh, and telling mathematicians cantor is wrong is a good way for them to not listen to anything else you say. even your own favoured Hilbert thought it was right.
hell, it is right.