Search Results
Your search for courses · during 26SP · taught by arafferty · returned 2 results
-
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.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 254.02 Spring 2026
- Faculty:Anna Rafferty 🏫 👤
- Size:28
- M, WLeighton 305 9:50am-11:00am
- FLeighton 305 9:40am-10:40am
-
28 seats held for CS Match until the day after X priority registration.
-
IDSC 298 FOCUS Sophomore Colloquium 1 credits
This colloquium is designed for sophomore students participating in the Focusing on Cultivating Scientists program. It will provide an opportunity to participate in STEM-based projects on campus and in the community. The topics of this project-based colloquium will vary each term.
Open only to students who completed IDSC 198
- Spring 2026
- No Exploration
-
Student has completed any of the following course(s): IDSC 198 with a grade of C- or better during their first year.
-
IDSC 298.01 Spring 2026
- Faculty:Anna Rafferty 🏫 👤
- Size:31
- Grading:S/CR/NC
- WHulings 316 3:10pm-4:20pm