CS 2250 A (CRN: 93394)
Computer Science: Computability& Complexity
3 Credit Hours—Section is Full.
The course CS 2250 A is currently full.
Complete the inquiry form below to help us gauge interest. We will attempt to add more seats in this or a similar course.
Please continue to check the availability of this course—enrollment may vary before the deadline to add:
About CS 2250 A
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
Syllabus Unavailable
Please contact the instructor for information about this course.
Important Dates
Note: These dates may not be accurate for select courses during the Summer Session.
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
There are no courses that meet this criteria.
Interest Form
The maximum enrollment for CS 2250 A has been reached.
Fill out this form to express interest in this course. If a seat becomes available, you will be notified.