Modify Your Search
Search Results
Your search for · CS 254 · during 2025-26 · returned 1 result
-
CS 254 Computability and Complexity 6 credits
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.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 or MATH 236 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 254.01 Winter 2026
- Faculty: Josh Davis 🏫 👤
- Size:28
- M, WHulings 316 1:50pm-3:00pm
- FHulings 316 2:20pm-3:20pm
-
22 seats held for CS Match until the day after First Year priority registration.
-
CS 254.01 Spring 2026
- Faculty: Chelsey Edge 🏫 👤
- Size:28
- M, WLanguage & Dining Center 104 12:30pm-1:40pm
- FLanguage & Dining Center 104 1:10pm-2:10pm
-
16 seats held for CS Match until the day after sophomore only priority registration.
-
CS 254.02 Spring 2026
- Faculty: Anna Rafferty 🏫 👤
- Size:28
- M, WHasenstab 002 9:50am-11:00am
- FHasenstab 002 9:40am-10:40am
-
3 seats held for CS Match until the day after junior priority registration.