Deutsch   English   Français   Italiano  
<a158b3ebe660be0350d37e03e31c5a9cc22cc643@i2pn2.org>

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

Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!news.quux.org!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Cantor Diagonal Proof
Date: Thu, 10 Apr 2025 21:21:18 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <a158b3ebe660be0350d37e03e31c5a9cc22cc643@i2pn2.org>
References: <vsn1fu$1p67k$1@dont-email.me> <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>
 <vsr1ae$1pr17$2@dont-email.me> <vst4nm$8daf$2@dont-email.me>
 <vsu9o4$lqc0$2@dont-email.me> <vsunj7$1redp$3@dont-email.me>
 <vsusb8$1v5ml$1@dont-email.me> <vsvuta$36pju$1@dont-email.me>
 <vt019f$37knt$1@dont-email.me> <vt1gs7$nigc$3@dont-email.me>
 <4a8988895deed610068ddca65068842dbc20bf7d@i2pn2.org>
 <vt42s9$32bmm$1@dont-email.me>
 <9c1620498b305f37e3f05840074d08af916377fc@i2pn2.org>
 <vt742v$1pl6i$3@dont-email.me>
 <d2008945d1cdd200cda8493b36f73fbf26967c1e@i2pn2.org>
 <vt9nn2$5t7s$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 11 Apr 2025 01:21:18 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="4021561"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <vt9nn2$5t7s$3@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0

On 4/10/25 8:28 PM, Lawrence D'Oliveiro wrote:
> On Wed, 9 Apr 2025 22:00:11 -0400, Richard Damon wrote:
> 
>> On 4/9/25 8:41 PM, Lawrence D'Oliveiro wrote:
>>>
>>> On Tue, 8 Apr 2025 18:57:17 -0400, Richard Damon wrote:
>>>
>>>> The problem is your "master" algorithm need the algorithms of *ALL*
>>>> the computable numbers within it, which is an infinite number of
>>>> algorithms, and thus isn't itself a finite algorithm.
>>>
>>> That is the problem with the Cantor construction, not with my disproof
>>> of it. My disproof of it only needs a finite number of list elements at
>>> any point in the proof. The Cantor construction needs them all.
>>
>> But a finite list can't get you to the needed arbitrary precision
>> needed.
> 
> I was going to say, sure it can, because the size of the list is a
> function of the precision you ask for.

But the function needs to be prepared to handle ANY precision, and thus 
needs to be infinite.


> 
> But that’s irrelevant, because if you’re saying an infinite list cannot be
> constructed, then that blows the Cantor construction out of the water,
> since an infinite list is precisely what it assumes.

But Cantor wasn't talking about "Construction" in that manner, as he 
wasn't talking about computability.

He was describing a method for a ideal infinite logic to create the value.

> 
>> Not also, Cantor only claimed that the numbers weren't countable, he
>> didn't talk about computable. That is a later work looking at the proof.
> 
> True. But interesting things happen when you try to apply his construction
> to other kinds of number lists.

But you need to remember that he wasn't "constructing" it in the manner 
you are assuming, it isn't being constructed by a finite function, as 
that wasn't the domain he was talking about.