Spring 2021 catalog is now live!

To determine if a course is remote, hybrid, or in-person use the catalog search tool to narrow results. Otherwise, when browsing courses, the section indicates teaching mode:

R = Remote
H = Hybrid
0 = In-person

Teaching modes (remote, hybrid, in-person) are subject to change at any point. Please pay close attention when registering. Depending on the timing of a teaching mode change, faculty also may be in contact with students.

MATH 361
Theory of Computation Fall 2020 (also offered Spring 2021)
Division III Quantative/Formal Reasoning
Cross-listed MATH 361 / CSCI 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/conference; Lecture content will be delivered through asynchronously viewed video modules. Conference sections meeting twice per week will be used for synchronous discussions. Students should sign up for lecture and one conference section.
Limit: 40(10/con)
Expected: 40
Class#: 2325
Grading: yes pass/fail option, no fifth course option
Requirements/Evaluation: online multiple choice and short answer questions, weekly problem sets in groups, a research project, 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:
MATH 361 Division III CSCI 361 Division III
QFR Notes: This course include regular and substantial problem sets in which quantitative/formal reasoning skills are practiced and evaluated.
Attributes: COGS Interdepartmental Electives

Class Grid

Updated 4:19 am ET

Course Catalog Search

(searches Title and Course Description only)



Start Time
End Time