-
Institution:
-
Southern Adventist University
-
Subject:
-
-
Description:
-
Prerequisites: CPTR 314; MATH 280. Formal models of computation such as finite state automata, push-down automata and Turing machines. Formal languages. Computability and complexity theory along with the practical implications of theoretical results. (Winter, odd numbered years)
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(423) 236-2000
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.