Fall 2010

Theoretical Foundations of Computer Science

Listed in: Computer Science, as COSC-38



This course covers basic mathematical concepts that are essential in computer science, and then uses them to teach the theory of formal languages and machine models of languages. The notion of computability will be introduced in order to discuss undecidable problems. The topics covered include: regular, context-free and context-sensitive languages, finite state automata, Turing machines, decidability, and computational complexity. Offered in alternate years.

Requisite: None, although analytical aptitude is essential. Fall semester.  Professor L. McGeoch.


2022-23: Not offered
Other years: Offered in Fall 2010, Spring 2013, Spring 2015, Spring 2017, Spring 2019, Spring 2021