This is the home page for CMPSCI 501. CMPSCI 501 is an advanced undergraduate/master's-level core course in the theory of computation and will deal with formal language theory (finite automata, regular languages, grammars, and pushdown automata), computability theory, and complexity theory.
This is essentially the same course that was called CMPSCI 401 until Spring 2014. Beginning with that semester it counts as a theory core course for M.S. students in computer science, as well as an upper-level undergraduate elective and a required course in the BS-CMPSCI Theory of Computation track. This course fulfills any requirements previously satisfied by CMPSCI 401.
Instructor Contact Info: David Mix Barrington, 210 CMPSCI building, 545-4329, office hours for Spring 2016 Tuesday 3-4, Wednesday 2:30-3:30, Thursday 1-2.
I generally answer my email fairly reliably.
TA Contact Info: Mark McCartin-Lim, email@example.com. Office hours Friday 1-2.
The course is primarily intended for undergraduates in computer science and related majors such as mathematics or computer engineering, for master's students in computer science, and for graduate students in other fields with the appropriate background and interest. CMPSCI 311 (theory of algorithms) is the primary prerequisite, though this may be negotiable for students with a strong mathematics background. The mathematical techniques taught in CMPSCI 250 (or similar courses like MATH 300 or MATH 455) will be used heavily. No programming will be assigned, but familiarity with programming at the level of at least CMPSCI 187 (data structures) will sometimes be assumed. This is probably the mathematically most difficult course in the CMPSCI undergraduate curriculum. It is a semi-elective course -- it fills requirements for any CMPSCI major and many MATH majors, but should be taken only by students whose mathematical ability and/or motivation is average or above relative to CMPSCI majors.
The textbook for the course is Introduction to the Theory of Computation by Michael Sipser, second edition. This is a very good book: I will be following it very closely for my lectures, and it is a very good long-term reference, but it is rather expensive. The first edition is available more cheaply, and the main text of the two is virtually identical, but the second edition will be the source of the problems I assign and it has a large number of solved exercises. (There is also a new third edition -- you may get that instead of the second, but it only differs primarily in having a new section on CFL's that I won't be using.) The book information has been posted on SPIRE, and thus the University's Amazon textbook entity has copies of the book available.
The course will meet for three lecture meetings a week, MWF 11:15-12:05 in Marston 211. There is no formal attendance requirement but there will be occasional graded in-class activities.
Announcements (25 July 2016):
Overall for the course I gave four A+, six ordinary A, six A-, three
B+, six B, four B-, three C+, four C, and one C- grade. You may pick exams
up from me either during the summer or the coming fall.
Thanks for an enjoyable course!
Overall for the course I gave four A+, six ordinary A, six A-, three B+, six B, four B-, three C+, four C, and one C- grade. You may pick exams up from me either during the summer or the coming fall.
Thanks for an enjoyable course!
Last modified 25 July 2016