CSCI3384 · Computer Science
Morrissey College of Arts & Sciences
This is a course in the theoretical foundations of computer science, centered around the theme of fundamental limits on computation. Topics include: Turing Machines, universal computation, undecidability of the halting problem, solvable and unsolvable algorithmic problems, recursive functions, Goedel's Incompleteness Theorem, time- and space-bounded computations, Cook's Theorem, NP-complete problems, problems solvable in polynomial space, randomized computation, application to cryptography, practical approaches to computationally intractable problems (such as SAT solvers), quantum computing, and Shor's Theorem.
Course experience
Averages use the original five-point historical evaluation scale.
Organization
4.4 / 5
How well the course was organized
Challenge
4.8 / 5
How intellectually challenging students found it
Attendance
4.5 / 5
How necessary attendance was
Assignments
4.6 / 5
How helpful assignments were
Weekly effort
~6.5
hours per week
Estimated from the original workload response buckets. Individual sections may differ.
Instructor options
Ratings below reflect only recovered evaluations connected to this course.
Across time
Section-level results available in the recovered archive.
Spring 2025
1 sectionFall 2023
1 sectionSpring 2022
1 sectionFall 2020
1 section