CS 405 - Theory of Computability

Institution:

New Jersey City University

Subject:

Description:

This is a survey of theoretical models of computation, notably the Turing machine model, the Markov algorithm model and register machine model, as well as equivalence results relating those models. Considerations of efficiency (complexity theory) are also introduced with an emphasis upon the use of big-O notation to describe the time/space requirements of specific machines. Simulation software is used extensively, thereby enabling students to design and run their own abstract machines. This is an essential course for students interested in pursuing graduate study. Prerequisite: CS 202 Discrete Structures I

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.njcu.edu

Phone Number:

(201) 200-2000

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.