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.
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 22/FA and CS and course number 254 found 1 course.
CS 254.00 Computability and Complexity 6 credits
Closed: Size: 34, Registered: 29, Waitlist: 0
| M | T | W | TH | F |
|---|---|---|---|---|
| 9:50am11:00am | 9:50am11:00am | 9:40am10:40am |
Requirements Met:
Other Tags:
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 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)
Search for Courses
This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub