Course Search

Search Results

Your search for · CS 254 · during 26WI · 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.

  • Offered: Winter 2026
  • Liberal Arts Requirements: FSR, Formal or Statistical Reasoning
  • Prerequisites:

    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.

  • Tags: CGSC Elective CL: 200 level CS Required for Major LING Pertinent LING Related Field MATH Discrete Structures MATH Electives NEUR Elective

  • 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.