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
- Michigan
- Calvin University
- Course info
- math-312 - logic-computability-and-complexity
Calvin University Course Info
Grand Rapids, Michigan
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.
MATH 312
Logic, Computability, and Complexity
An introduction to first-order logic, computability and computational complexity. Topics covered include soundness and completeness of a formal proof system, computability and non-computability, and computational complexity with an emphasis on NP-completeness. Also listed as CS 312
Units: 4.0
Prerequisites:
MATH 252 - Discrete Mathematics for Computer Science
and
MATH 251 - Discrete Mathematics
or
MATH 255 - Introductory Linear Algebra