| Deutsch English Français Italiano |
|
<vsqmlb$1ktm5$6@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Lawrence D'Oliveiro <ldo@nz.invalid> Newsgroups: comp.theory Subject: Re: Cantor Diagonal Proof Date: Sat, 5 Apr 2025 07:38:19 -0000 (UTC) Organization: A noiseless patient Spider Lines: 11 Message-ID: <vsqmlb$1ktm5$6@dont-email.me> References: <vsn1fu$1p67k$1@dont-email.me> <7EKdnTIUz9UkpXL6nZ2dnZfqn_ednZ2d@brightview.co.uk> <vsng73$27sdj$1@dont-email.me> <gGKdnZiYPJVC03L6nZ2dnZfqn_udnZ2d@brightview.co.uk> <vsnk2v$2fc5a$1@dont-email.me> <vsnmtg$2i4qp$3@dont-email.me> <vsno7m$2g4cd$3@dont-email.me> <vsnp0o$2ka6o$2@dont-email.me> <vsnpv4$2g4cd$6@dont-email.me> <vsntes$2osdn$1@dont-email.me> <vsntv3$2paf9$1@dont-email.me> <vso1a0$2sf7o$1@dont-email.me> <vso2ff$2tj1d$2@dont-email.me> <vso3rj$2vems$2@dont-email.me> <vso4gh$2vg3b$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Sat, 05 Apr 2025 09:38:19 +0200 (CEST) Injection-Info: dont-email.me; posting-host="9f11b097b26f2656761f9579e269a581"; logging-data="1734341"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+UEhgHpqzSvgKx745p27Y6" User-Agent: Pan/0.162 (Pokrosvk) Cancel-Lock: sha1:MdNEQuAA4CAECzGTtk9MscaPmgs= 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.