Piers Cawley wrote: > "Daniel S. Wilkerson" <dsw@digital-integrity.com> writes: > > > "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. > > It's finite as well isn't it? No. For example, if you include the digits 0-9 in your alphabet, you get the standard decimal representation of the non-negative integers. Daniel ==== Want to unsubscribe from Fun With Perl? Well, if you insist... ==== Send email to <fwp-request@technofile.org> with message _body_ ==== unsubscribe