CS 2250 B (CRN: 91863)

Computer Science: Computability& Complexity (B)

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; Coreq: CS 2240; Open to Degree and PACE students

Syllabus Unavailable

Please contact the instructor for information about this course.

Important Dates

Note: These dates may change before registration begins.

Courses may be cancelled due to low enrollment. Show your interest by enrolling.

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

Other Sections

Remind Me Form

Remind yourself about CS 2250 B.

We'll send you a reminder before Fall 2026 registration begins.