On Mon, May 28, 2001 at 02:49:34PM -0400, Bernie Cosell wrote: > On 28 May 2001, at 10:56, by way of owner-fwp@technofile.org wrote: > > > that matches an unbounded set of strings. remember, there is more then 1 > > infinity. there are infinite infinities! > > > > a aa aaa aaaa aaaaa .................................... (infinity) > > Yeah, but in this world there's only one infinity, since everything is > constrained to be countable. Well.... only if you match against finite strings. However, regexes can match infinite strings as well. And since there is an obvious, 1-to-1 mapping between the set of reals between 0 and 1 and the set of strings (including the infite length strings) consisting of digits only, and each such a string is matched by /^\d+$/, it's not true that a set matched by a regex is of countable size. Abigail ==== Want to unsubscribe from Fun With Perl? Well, if you insist... ==== Send email to <fwp-request@technofile.org> with message _body_ ==== unsubscribe