Mathematics and Statistics 312 - Logic,Computability,and Complexity

Institution:

Calvin University

Subject:

Description:

F, even 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 Computer Science 312. Prerequisite: Mathematics 256.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.calvin.edu

Phone Number:

(616) 526-6000

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Four-one-four plan

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.