Mathematics and Computer Science 361 - Theory of Computation

Institution:

Macalester College

Subject:

Description:

A discussion of the basic theoretical foundations of computation as embodied in formal models and descriptions. The course will cover finite state automata, regular expressions, formal languages, Turing machines, computability and unsolvability, and the theory of computational complexity. Introduction to alternate models of computation and recursive function theory. Prerequisite: Computer Science 124, Mathematics 136, or permission of the instructor. Every spring. (4 credits)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.macalester.edu

Phone Number:

(651) 696-6000

Regional Accreditation:

North Central 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.