Sujet : Re: Cantor Diagonal Proof
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 07. Apr 2025, 11:51:02
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <4f76ca62230e22e1b4f57993da089ad7db0b1136@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9
User-Agent : Mozilla Thunderbird
On 4/7/25 3:36 AM, Lawrence D'Oliveiro wrote:
On Sun, 6 Apr 2025 13:42:44 +0300, Mikko wrote:
On 2025-04-05 07:26:38 +0000, Lawrence D'Oliveiro said:
>
On Sat, 5 Apr 2025 10:10:44 +0300, Mikko wrote:
>
The proof is finite and complete.
>
It requires showing that there is no complete match among an infinity
of digits.
>
Cantor's proof and every proof with Cantor's diagonal method shows that.
Except for that example list I gave where I proved by induction that it
does not.
Your problem is you assume you can compute the nth value from the value of n, but that requires you master algorithm include an infinite number of algorithms in itself to choose from to build that number.
What you induction fails to note is that it just assumes the availability of the infinite set of construction algorithms to the finite master algorithm. THAT requires a contradiction in terms, so can't be done.
…