Re: Well Ordering the Reals
- From: stevendaryl3016@xxxxxxxxx (Daryl McCullough)
- Date: 9 Nov 2005 08:51:41 -0800
Tony Orlow says...
>Randy Poe said:
>> In the countable bit strings, I label the bits with elements of N.
>
>That sounds okay. So, don't we have an uncountable number of bitstrings
>with a countable number of lengths?
Randy is talking about infinite bitstrings, all with exactly
the same "length". And yes, there are uncountably many infinite
bit strings.
>> > Which of those maps to N?
>>
>> The one that has a 1 for every bit n, where n is an element of N.
>> Every countable bit string has either a 1 or a 0 for every n in N,
>> so there's certainly one which has 1 for all n in N.
>Does that look like .....111111?
Yes.
>Ahem. Are you saying that, without knowing where the unending string of bits
>ends, you cannot make any judgements about what an infinite string of bits
>means?
For any set A, you can talk about "bit strings over A", which
are basically functions from A into {0,1}. For Randy's infinite
bitstrings, A=N, the set of all (finite) natural numbers.
>Listen, a countable number of bits, such that each is finite, is
>supposedly sufficient to produce an uncountable number of bit
>strings, ala 2^aleph_0, no?
Yes, that's right. There are uncountably many infinite bitstrings.
--
Daryl McCullough
Ithaca, NY
.
- References:
- Re: Well Ordering the Reals
- From: Robert Low
- Re: Well Ordering the Reals
- From: David Kastrup
- Re: Well Ordering the Reals
- From: Tony Orlow
- Re: Well Ordering the Reals
- From: Daryl McCullough
- Re: Well Ordering the Reals
- From: Randy Poe
- Re: Well Ordering the Reals
- From: Tony Orlow
- Re: Well Ordering the Reals
- From: Tony Orlow
- Re: Well Ordering the Reals
- Prev by Date: Re: Well Ordering the Reals
- Next by Date: Re: Well Ordering the Reals
- Previous by thread: Re: Well Ordering the Reals
- Next by thread: Re: Well Ordering the Reals
- Index(es):
Relevant Pages
|
Loading