Sujet : Re: Cantor Diagonal Proof
De : ldo (at) *nospam* nz.invalid (Lawrence D'Oliveiro)
Groupes : comp.theoryDate : 05. Apr 2025, 08:38:19
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vsqmlb$1ktm5$6@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
User-Agent : Pan/0.162 (Pokrosvk)
On Fri, 4 Apr 2025 09:16:17 +0100, Richard Heathfield wrote:
Since all elements (except your two openers) begin with a 3, none of
them start 12, and so after just two iterations we have already
constructed a number that's not in the infinite list.
Remember that the hypothesis of the Cantor “proof” is that the list is
already supposed to contain every computable number. The fact that the
contruction succeeds for your list examples does not mean it will succeed
with mine. Remember, the “proof” depends on it succeeding in the general
case, with every possible list.