Deutsch   English   Français   Italiano  
<vstl33$p9c2$1@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: comp.theory
Subject: Re: Cantor Diagonal Proof
Date: Sun, 6 Apr 2025 13:29:55 +0300
Organization: -
Lines: 18
Message-ID: <vstl33$p9c2$1@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> <vsqmlb$1ktm5$6@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 06 Apr 2025 12:29:56 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="c289a35489489d88fb7cd6e10493bedd";
	logging-data="828802"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+ekLrrcxxN/vF+jbdOBGIa"
User-Agent: Unison/2.2
Cancel-Lock: sha1:05muwy6kn7W6Y5oqnXaP1tU/mjs=
Bytes: 2027

On 2025-04-05 07:38:19 +0000, Lawrence D'Oliveiro said:

> 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.

How can Cantor's construction fail to succeed on a list?

-- 
Mikko