|Office:||311 Heller Hall|
|Office Hours:||M 4-5, Tu 2-4, W 12-12:50, F 3-4 and by appointment|
|Lectures:||M, W, F 2-2:50 p.m. and M 3-3:50 p.m. in HH 306|
|Course Web Site:||http://www.d.umn.edu/~ddunham/cs4511s10|
|Teaching Assistant:||Sathavahana (Sathu) Bhogapathi|
|Consulting:||Tuesdays 6-8 p.m. in HH 314, Wednesdays 3-4 p.m. in MWAH 177|
Course Desciption (pdf): http://www.d.umn.edu/cs/asse/desc/4511.pdf
Fundamentals of the mathematical theory of computation. Turing machines, Church-Turing Thesis, recursive and recursively enumberable languages, unsolvable problems, Rice's Theorem, deterministic and nondeterministic time and space complexity, complexity classes, NP-completeness, Cook's Theorem, P vs NP.
CS 3511 or 3512 or #, or the equivalent if you are a transfer student.
Important note: The computer science bachelor's degree program at UMD is accredited by CAC (the Computing Accreditation Commission). One of the CAC requirements is that all students must satisfy the prerequisites in order to be admitted to a course, so if you have not passed the prerequisite courses, you must drop this course (if you have any questions about this, please see the instructor after the lecture or during office hours).
Course Objectives and Content:
This course introduces elements of the theory of computation, an active research area involving the formulation of precise questions and answers concerning what is computable, by what means, and in what amount of space and time. Remarkably, such work does not depend essentially on any particular digital technology or programming language. Instead, computations are expressed and studied as mathematical objects. In this spirit, the course emphasizes standard methods for expressing and establishing mathematically precise claims. We introduce many well-known, widely-studied definitions and carefully consider what follows from them.
The following is a rough outline of the material from the text that I hope to cover in the course. Automata and languages (Part 1), computability theory (Part 2 except for Chapter 6), time complexity (Chapter 7), and if time permits, topics from space complexity (Chapter 8), intractability (Chapter 9), and cryptography (from Chapter 10).
The University of Minnesota is committed to the policy that all persons shall have equal access to its programs, facilities, and employment without regard to race, color, creed, religion, national origin, sex, age, marital status, disability, public assistance status, veteran status, or sexual orientation. As instructor, I am committed to upholding University of Minnesota's equal opportunity policy. I encourage you to talk to me in private about any concerns you have related to equal opportunity in the classroom. To inquire further about the University's policy on equal opportunity, contact the Office of Equal Opportunity, 269-273 DAdB, (http://www.d.umn.edu/equaloo), phone: (218) 726-6827 or (218) 726-6849, email: firstname.lastname@example.org.
Students with Disabilities:
If you have any disability (either permanent or temporary) that might affect your ability to perform in this class, please inform me at the start of the quarter. I may adapt methods, materials, or testing so that you can participate equitably. To learn about the services that UMD provides to students with disabilities, contact Disability Services and Resources 258 Kirby Student Center, (http://www.d.umn.edu/access), phone: (218) 726-6130, email: email@example.com or contact the Office of Equal Opportunity, 269-273 DAdB, (http://www.d.umn.edu/equaloo), phone: (218) 726-6827, email: firstname.lastname@example.org.
Mental Health Statement:
As a student you may experience a range of issues that can cause barriers to learning, such as strained relationships, increased anxiety, alcohol/drug problems, feeling down, difficulty concentrating and/or lack of motivation. These mental health concerns or stressful events may lead to diminished academic performance or reduce a student’s ability to participate in daily activities. University of Minnesota services are available to assist you with addressing these and other concerns you may be experiencing. You can learn more about the broad range of confidential mental health services available on campus via the UMD Health Service Counseling website at http://www.d.umn.edu/hlthserv/counseling/.
Introduction to the Theory of Computation, Second Edition,
Thompson Course Technology,
Web site: http://www-math.mit.edu/~sipser/book.html
It is not directly required that you attend class, however: You are responsible for reading assigned text material and for material covered in class and in the lab, including:
If you are unable to attend a class meeting, it is your responsibility to obtain class notes, assignments, and extra copies of handouts from your study partner. Note: assignments are due at the beginning of class on the due date (unless otherwise specified) -- they will be docked 25% per day if turned in late.
The assignments will consist of written homework. The homework should adhere to the Written Homework Format.
Examinations and Grading:
There will be a midterm exam, worth 100 points and a final exam worth 200 points. The final exam will be comprehensive.
|Exam||Points||Date and Time|
|Midterm Exam||100 points||Wednesday, March 10, 2-2:50 pm in HH 306|
|Final Exam||200 points||Friday, May 14, 2-3:55 pm in HH 306|
Exams will not be given early, and makeups must be justified by dire circumstances described to the instructor before the time of the exam. It is Department of Computer Science policy not to return final exams, however they are kept and you can look at your exam in the instructor's office. The UMD Final Examination Policy web page explains the UMD policy about having more than two final exams on a single day, among other things.
Scores and total points
will be maintained by the TA on the TA's web site.
During the semester, distributions of
scores and total points
will be posted on the
"Score Distributions" page of
the class web site:
Grading Procedures: Final grades are based on total points distributed approximately as follows: