CIS 331 - Theory Of Computability

Institution:

Cheyney University of Pennsylvania

Subject:

Computer Science

Description:

Turing machines, unsolvability results, and the halting problem are discussed Consideration is given to the study of machines with restructured memory access, limited memory, and limited computing time. Study also includes recursive function theory and complexity classification. Comparisons of searching and sorting techniques are studied through the use of computation models including relationships to algorithms and programming.Pre-Requisite: CIS101 & MAT202

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.cheyney.edu

Phone Number:

(610) 399-2275

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.