Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Lawrence D'Oliveiro Newsgroups: comp.theory Subject: Re: Cantor Diagonal Proof Date: Fri, 4 Apr 2025 07:21:36 -0000 (UTC) Organization: A noiseless patient Spider Lines: 22 Message-ID: References: <7EKdnTIUz9UkpXL6nZ2dnZfqn_ednZ2d@brightview.co.uk> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Fri, 04 Apr 2025 09:21:36 +0200 (CEST) Injection-Info: dont-email.me; posting-host="a838268cadc40d8a0ecf633714aea4dd"; logging-data="3030264"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/m5LAU3dd6zCMKUgTlfaMv" User-Agent: Pan/0.162 (Pokrosvk) Cancel-Lock: sha1:RrKIih9bxIM4ZvBXABpC4CWyj+k= On Fri, 4 Apr 2025 07:24:35 +0100, Richard Heathfield wrote: > On 04/04/2025 07:15, Lawrence D'Oliveiro wrote: > >> On Fri, 4 Apr 2025 06:16:20 +0100, Richard Heathfield wrote: >> >>> The Cantor diagonal argument shows that *any* list, finite or >>> infinite, >>> is incomplete. >> >> But it takes an infinite number of steps to show that for an infinite >> list. And at every point, the probability that the N digits computed so >> far match some number later in the list is 1. > > Depends on the list. No it doesn’t. At every point N, we have the first N digits of our hypothetical number-that-is-not-in-the-list. But we have an infinitude of remaining numbers in the list we haven’t looked at, among which all possible combinations of those N digits will occur. Therefore there is guaranteed to be some number we haven’t looked at yet with all those first N digits the same.