CMPUT 325 Special

       Introduction     Postscript
         1     Fast growth
         2     Restricted language
         3     Finish Restricted
         4     Pattern matching  example
         5     Pattern Matching Program
         6      a^n b^n example
         7     Why it cannot be  done
            7(a)   the pigeon hole example
         8    Discussion of DFA's in real use
         9     Halting introduction
        10    Diagonal.c
        11    Proof
        12     yeah but...
        13     Collatz (3n+1) problem
        14     Church-Turing Thesis