Re: Matching Unicode strings and combining characters [wa...

From: peter_constable@sil.org
Date: Thu Sep 30 1999 - 13:21:56 EDT


       Subject:
       Re: Matching Unicode strings and combining characters [was:
       basi
       ---------------------------------
       
       
>For example, the consumer can wait for the appearance of an
       `a' (algorithm: wait for a character, if it is an `a' return,
       else repeat). Therefore, the set of all (possibly infinite)
       strings containing an `a' is an observable. On the other hand,
       the set of (possibly infinite) strings *not* containing an `a'
       is not an observable (at any point in time, you cannot be sure
       that an `a' will not appear later).

       Wasn't this named "the halting problem" by Church?



This archive was generated by hypermail 2.1.2 : Tue Jul 10 2001 - 17:20:53 EDT