CSE 6321

Computability and Complexity

3credits
About this course

Turing machines, decidability, recursive enumerability; many-to-one and polynomial-time reductions; NP-completeness, Cook-Levin Theorem; Recursion Theorem. Prereq: 3321 (625) or 5321. Not open to students with credit for 725.

All available terms

8 terms

Avg. GPA
3.48
Grades
129

Other grades

W5.4%
More course details

Ohio State University

CSE 6321 at Ohio State: average GPA 3.48 across 129 students. Grade distribution by term. Turing machines, decidability, recursive enumerability; many-to-one…

Average GPA: 3.48

Grade distribution records: 129 students across 8 terms.

Grade distribution

GradeStudentsPercent
A5038.8%
A-2015.5%
B+1814.0%
B1410.9%
B-1511.6%
C+21.6%
C21.6%
F10.8%
W75.4%

Based on 129 student grade records across 8 terms and 3 professors.

Instructors

Related courses

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades