CSCI 361
Theory of Computation Fall 2024
Division III Quantitative/Formal Reasoning
Cross-listed 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: 24
Expected: 24
Class#: 1938
Grading: no pass/fail option, no fifth course option
Requirements/Evaluation: weekly problem sets and one or more exams
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 Quantitative/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 7:00 am

Course Catalog Search

(searches Title and Course Description only)



Start Time
End Time