CSCI 361
Theory of Computation Fall 2019 (also offered Spring 2020)
Division III Quantative/Formal Reasoning
Cross-listed CSCI 361 / MATH 361

Class Details

This course introduces a formal framework for investigating both the computability and complexity of problems. We study several models of computation including finite automata, regular languages, context-free grammars, and Turing machines. These models provide a mathematical basis for the study of computability theory–the examination of what problems can be solved and what problems cannot be solved–and the study of complexity theory–the examination of how efficiently problems can be solved. Topics include the halting problem and the P versus NP problem.
The Class: Format: lecture
Limit: 30
Expected: 30
Class#: 1658
Grading: no pass/fail option, no fifth course option
Requirements/Evaluation: problem sets, a midterm examination, and a final examination
Prerequisites: CSCI 256 or both a 300-level MATH course and permission of instructor
Enrollment Preferences: current or expected Computer Science majors
Distributions: Division III Quantative/Formal Reasoning
Notes: This course is cross-listed and the prefixes carry the following divisional credit:
CSCI 361 Division III MATH 361 Division III
Attributes: COGS Interdepartmental Electives

Class Grid

Updated 7:15 am ET

Course Catalog Search

(searches Title and Course Description only)



Start Time
End Time