Search Results
Your search for courses · during 24FA · taught by cedge · 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 2024
- 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.00 Fall 2024
- Faculty:Chelsey Edge 🏫 👤
- Size:34
- M, WLanguage & Dining Center 104 11:10am-12:20pm
- FLanguage & Dining Center 104 12:00pm-1:00pm
-
34 spots held for students in CS Match until 9:00 a.m. May 24