-
Institution:
-
University of New Orleans
-
Subject:
-
-
Description:
-
Prerequisites: CSCI 2125 and MATH 2721, or consent of department. An introduction to the theory of computation, including automata; computability, and complexity. Topics include automata and languages: decidability, reducability, and the Church-Turing thesis; complexity and intractability
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(504) 280-6000
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.