Modify Your Search
Search Results
Your search for courses · during 25SP · taught by loesper · 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 2025
- 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 394 Directed Research in Computer Science 1 – 6 credits
Students work on a research project related to a faculty member's research interests, and directed by that faculty member. Student activities vary according to the field and stage of the project. The long-run goal of these projects normally includes dissemination to a scholarly community beyond Carleton. The faculty member will meet regularly with the student and actively direct the work of the student, who will submit an end-of-term product, typically a paper or presentation.
Register for this course by submitting the Directed Research form which requires approval from the project faculty supervisor and your adviser.
- Spring 2025, Fall 2025, Winter 2026, Spring 2026
- No Exploration