About CS 2250 B
Formal languages and expressiveness. Turing completeness and Church's Thesis. Decidability and tractability. Complexity classes and theory of NP completeness. Prerequisites: CS 1640 or MATH 2055. Co-requisite: CS 2240.
Notes
Prereqs enforced by the system: CS 1640 or MATH 2055; Open to Degree and PACE Students
Section Description
First course on automata, computability, and complexity.
Evaluation
Weekly quizzes, exams (3), homework (5 or 6), weekly active learning exercises.
Important Dates
Note: These dates may change before registration begins.
Note: These dates may not be accurate for select courses during the Summer Session.
| Last Day to Add | |
|---|---|
| Last Day to Drop | |
| Last Day to Withdraw with 50% Refund | |
| Last Day to Withdraw with 25% Refund | |
| Last Day to Withdraw |
Resources
There are no courses that meet this criteria.
Interest Form
CS 2250 B is closed to new enrollment.
But we can remind you a few days before the next term opens. You can also see what terms are enrolling currently.