Mathematics & Statistics (Sci) : Calculability on an infinite abacus is compared with recursive functions and Turing machines. Categorial, context-free, generative and transformational grammars are studied for formal and natural languages, with some emphasis on English and French morphology. Machines for generating and recognizing sentences are discussed.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.