Re: Turing vs math

From: <hal.domain.name.hidden>
Date: Thu, 4 Nov 1999 08:08:10 -0800

Marchal <marchal.domain.name.hidden> writes:
> Step n owns 2^(n-1) initial segments.
>
> Now, could you give me a bitstring which is not generated
> by this countably infinite process ?

Are you familiar with Cantor's diagonalization argument which proves that
the real numbers are greater in cardinality than the integers? It
directly disproves your statement.

The real number 2/3, = .10101010... is never output by your procedure.
If you disagree, tell me at what step it is output.

Hal
Received on Thu Nov 04 1999 - 08:11:05 PST