ENROLL Course Search

NOTE: There are some inconsistencies in the course listing data - ITS is looking into the cause.

Alternatives: For requirement lists, please refer to the current catalog. For up-to-the-minute enrollment information, use the "Search for Classes" option in The Hub. If you have any other questions, please email registrar@carleton.edu.

Saved Courses (0)

Computer Science (CS) Courses

For graduation requirements and additional information about this department or program, please see the Academic Catalog.

Your search for courses for 17/WI and CS and course number 254 found 1 course.

Revise Your Search New Search

CS 254.00 Computability and Complexity 6 credits

Closed: Size: 34, Registered: 40, Waitlist: 0

Language & Dining Center 104

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 46155

David Liben-Nowell

An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.

Prerequisite: Computer Science 111 and either Computer Science 202 or Mathematics 236

Search for Courses

This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub

Instructional Mode
Class Period
Courses or labs meeting at non-standard times may not appear when searching by class period.
Requirements
You must take 6 credits of each of these.
Overlays
You must take 6 credits of each of these,
except Quantitative Reasoning, which requires 3 courses.
Special Interests