CS 2250 B (CRN: 92354)
Computer Science: Computability& Complexity
3 Credit Hours
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
Syllabus Unavailable
Please contact the instructor for information about this course.
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.