Fall Term 2021 3:10 MWF Mr. Gregg
CMSC 515 is a course in the theoretical underpinnings of computer science. We will study abstract models of computing devices, limitations of computing devices, and some applications that arise directly from theory.
How this Course is Structured
We will meet three times a week for lectures. I will assign daily homework problems that will be collected approximately once a week.
We will have two midterm exams and a final exam. Midterm exams are tentatively scheduled for weeks four and eight.
Assignments and exams have the following weights:
Problem sets - 40% Midterm exams - 17% each Final exam - 26%
Late policy for problem sets is that problem sets may be turned in one class meeting after the initial due date for a 10% penalty. If you turn in a portion of a problem set on time and the remainder late, the 10% penalty will only apply to those problems you submitted late. I will waive the 10% penalty if you have a valid excuse such as illness; however, you must contact me before the initial due date to ask for an extension.
Our text is Introduction to the Theory of Computation, Third Edition by Michael Sipser.
Office Hours
If you need assistance with anything, you are welcome to see me in office hours or send me a question by email to greggj@lawrence.edu. My office hours this term are 9:00-10:30 MWF, and 2:00-4:00 TTh. Office hours this term will be held remotely: I will send out a Zoom link by email at the start of the term.
The course web site is at http://www.lawrence.edu/fast/greggj/cmsc515.html
Week | Topic | Chapter |
---|---|---|
1, 2 | Regular Languages | 1 |
2, 3, 4 | Context-Free Languages | 2 |
4, 5 | Turing Machines | 3 |
6 | Decidability | 4 |
7 | Reducibility | 5 |
7, 8 | Recursion Thm, Gödel's Incompleteness Thm | 6 |
9, 10 | Computational Complexity | 7 |