CSC 8510 - Theory of Computability

Institution:

Villanova University

Subject:

Description:

Description: Automata theory: deterministic and non-deterministic finite automata, pushdown automata, regular languages, context-free grammars, pumping lemma. Computability and recursion theory: Turing machines and their variations, decidability and recursive enumerability, mapping reducibility and Turing reducibility, undecidability of the halting problem, logical theories and Godel's incompleteness theorem. Complexity theory: time complexity, space complexity, major open problems on computational complexity. Corequisite: CSC 8301 or degree program in mathematics. 3.00credit(s) Restrictions: Must be enrolled in one of the following Levels: Graduate Arts and Sciences Prerequisites: Graduate Arts and Sciences level CSC 8301 Minimum Grade of C

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.villanova.edu

Phone Number:

(610) 519-4500

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.