Sujet : Re: Cantor Diagonal Proof
De : ldo (at) *nospam* nz.invalid (Lawrence D'Oliveiro)
Groupes : comp.theoryDate : 04. Apr 2025, 05:24:16
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vsnmtg$2i4qp$3@dont-email.me>
References : 1 2 3 4 5
User-Agent : Pan/0.162 (Pokrosvk)
On Fri, 4 Apr 2025 04:35:59 +0100, Richard Heathfield wrote:
The Cantor argument constructs a number that is not
in the input list and thus proves that the input list, no matter how
large, is incomplete.
But that proof takes an infinite number of steps. At every point, the
probability that the N digits computed so far match some number later in
the list is 1.
…