CS U390 - Theory of Computation

Institution:

Northeastern University

Subject:

Description:

Introduces the theory behind computers and computing aimed at answering the question, "What are the capabilities and limitations of computers " Covers automata theory, computability, and complexity. The automata theory portion includes finite automata, regular expressions, nondeterminism, nonregular languages, context-free languages, pushdown automata, and noncontext-free languages. The computability portion includes Turing machines, the Church-Turing thesis, decidable languages, and the Halting theorem. The complexity portionincludes big-O and small-o notation, the classes P and NP, the P vs. NP question, and NP-completeness.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.northeastern.edu

Phone Number:

(617) 373-2000

Regional Accreditation:

New England Association of Schools and Colleges

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.