[Date Prev][Date Next][Thread Prev][Thread Next]
[Search]
[Date Index]
[Thread Index]
Re: [FWP] japhy had a silly idea...
"Piers Cawley (by way of owner-fwp@technofile.org)" wrote:
> You know, I'm pretty certain that the set of all strings is
> uncountable, by Cantor's Diagonalization.
The set of all *countable* sequences from a finite alphabet is uncountable. The
standard definition of the set of all strings is the set of all *finite*
sequences from the alphabet. This is countable.
Daniel
==== Want to unsubscribe from Fun With Perl? Well, if you insist...
==== Send email to <fwp-request@technofile.org> with message _body_
==== unsubscribe