This site uses cookies. By continuing to use this site, closing this banner, or clicking "I Agree", you agree to the use of cookies.
Read our cookies policy and privacy statement for more information.
Stand with UkraineDonate
- Home
- Vermont
- University of Vermont
- Course info
- cs-125 - qr-computabilityand-complexity
University of Vermont Course Info
Burlington, Vermont•
2 reviews
Course Info
Search for courses by clicking on letters of the alphabet or by using a search bar. Explore course description, number of credits required and course sequences to satisfy graduation requirements.
CS 125
QR: Computability& Complexity
Formal languages and expressiveness. Turing completeness and Church's Thesis. Decidability and tractability. Complexity classes and theory of NP completeness.
Units: 3.0
Corequisites:
CS 124 - QR: Data Struc & Algorithms
Prerequisites:
MATH 052 - QR:Fundamentals of Mathematics
or
CS 064 - QR: Discrete Structures