CSCI 4050 - Computability and Complexity

Institution:

Roberts Wesleyan University

Subject:

Description:

This course discusses concepts of languages defined by formal grammars, Turing machines and rewriting systems, computability, Church-Turing thesis, decidable and undecidable problems, computational complexity, polynomial reducibility, NP-completeness, and Cook's theorem. Prerequisites/Corequisites: Prerequisite: CSCI 2400. When Offered: Fall term annually. Credit Hours: 4

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.Roberts.edu

Phone Number:

(585) 594-6000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

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.