Note: This is the 2010–2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
Overview
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.
- Winter