Re: Cantor Diagonal Proof

On Tue, 8 Apr 2025 18:59:02 -0400, Richard Damon wrote:

On 4/8/25 5:05 PM, Lawrence D'Oliveiro wrote:
>

On Mon, 7 Apr 2025 06:47:43 -0400, Richard Damon wrote:
 

And an infinite listing of values doesn't need to be computable, even
if every number in the list is computable.

 
Computability is a characteristic of particular numbers. It is a
characteristic of all the numbers in the list, and of the number that
the Cantor construction tries to construct from those numbers in the
list.
 
The fact that you can’t apply that characteristic to the set as a whole
is irrelevant, since the set itself is not a number.

 
Right, so the DIAGONAL number, which you claim to be computable, needs a
finite algorithm to do so.
 
The algorithm described is NOT FINITE, as it includes the infinite
number of algorithms to compute all the other numbers.

Potentially, *any* computable number could need an infinite amount of
storage (as well as an infinite number of computation steps) to compute an
infinite number of digits. But the storage needed is always finite for a
finite number of digits. That is true of the Cantor construction as well.

Remember, if you’re saying that the list cannot be constructed in the
first place, then you’re destroying the Cantor proof as well. I am
assuming it can be constructed, because the Cantor proof assumes it can be
constructed. You can’t knock out my proof and keep the Cantor one by
saying the list cannot be constructed.