CSci 265, Computer Theory I

The content of this course is determined by the Hunter College Course Catalog. The required material includes regular sets, regular expressions, finite automata, determinism and non-determinism, context-free grammars, and pushdown automata. When I teach this class, I also introduce undecidability and unsolvability and spend a little bit of time talking about David Hilbert and the historical importance of his work and his challenge to the mathematical community in the lecture that he gave before the International Congress of Mathematicians at Paris in 1900.

Home page for Spring 2008