Search Results
Your search for courses · during 25FA, 26WI, 26SP · taught by jdavis · returned 3 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.
- Winter 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.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.
-
MATH 240 Probability 6 credits
Introduction to probability and its applications. Topics include discrete probability, random variables, independence, joint and conditional distributions, expectation, limit laws and properties of common probability distributions.
- Fall 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 120 or MATH 211 or greater with a grade of C- or better or received a Carleton MATH 211 or better Requisite Equivalency or equivalent.
-
MATH 354 Topology 6 credits
An introduction to the study of topological spaces. We develop concepts from point-set and algebraic topology in order to distinguish between different topological spaces up to homeomorphism. Topics include methods of construction of topological spaces; continuity, connectedness, compactness, Hausdorff condition; fundamental group, homotopy of maps.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.