2019-2020 Catalog 
    
    Feb 01, 2023  
2019-2020 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

MATH 312 - Logic, Computability, and Complexity

(4)
FA, alternate years. 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 . Prerequisite: either MATH 255  or both MATH 251  and MATH 252 .



Add to Portfolio (opens a new window)