Modify Your Search
Search Results
Your search for courses · during 25SP · tagged with LING Related Field · returned 3 results
-
CS 202 Mathematics of Computer Science 6 credits
This course introduces some of the formal tools of computer science, using a variety of applications as a vehicle. You’ll learn how to encode data so that when you scratch the back of a DVD, it still plays just fine; how to distribute “shares” of your floor’s PIN so that any five of you can withdraw money from the floor bank account (but no four of you can); how to play chess; and more. Topics that we’ll explore along the way include: logic and proofs, number theory, elementary complexity theory and recurrence relations, basic probability, counting techniques, and graphs.
- Spring 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 111 with a grade of C- or better or received a score of 4 or better on the AP Computer Science exam or received a Carleton Computer Science 111 or better Requisite Equivalency AND MATH 101 or MATH 111 or greater with a grade of C- or better or greater or received a score of 4 or better on the Calculus AB AP exam or received a score of 4 or better on the Calculus BC AP exam or received a score of 5 or better on the Mathematics IB exam or received a Carleton MATH 111 or better Requisite Equivalency.
-
CS 202.00 Spring 2025
- Faculty: Eric Alexander 🏫 👤
- Size:28
- M, WAnderson Hall 223 12:30pm-1:40pm
- FAnderson Hall 223 1:10pm-2:10pm
-
15 – reserved for REQ: CS 202 Match (Condition Rule) until 03/07/2025.
-
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.
-
PHIL 210 Logic 6 credits
The study of formal logic has obvious and direct applicability to a wide variety of disciplines (including mathematics, computer science, linguistics, philosophy, cognitive science, and many others). Indeed, the study of formal logic helps us to develop the tools and know-how to think more clearly about arguments and logical relationships in general; and arguments and logical relationships form the backbone of any rational inquiry. In this course we will focus on propositional logic and predicate logic, and look at the relationship that these have to ordinary language and thought.
- Spring 2025
- FSR, Formal or Statistical Reasoning
-
PHIL 210.00 Spring 2025
- Faculty: Jason Decker 🏫 👤
- Size:25
- M, WWeitz Center 233 9:50am-11:00am
- FWeitz Center 233 9:40am-10:40am