The objectives of this course are to excite students’ interest in computer science and to give students a precise understanding of several difficult concepts that are fundamental to modern computer science. Topics may include induction and recursion; algebraic characterization; syntax; semantics; formal logic; soundness, completeness, and decidability; specification, algorithm, and determinism; and complexity. (Restricted to students registered in programs offered wholly or jointly by Computer Science or by Mathematics and Statistics, or with approval of Computer Science.) (3 lecture, 1.5 laboratory hours a week)
Menu
