-
Institution:
-
University of Massachusetts-Dartmouth
-
Subject:
-
Computer and Information Science
-
Description:
-
3 hours lecture Prerequisites: CIS 361 Several of the most significant models of computation will be reviewed, i.e., Turing machines, 1-calculus, predicate calculus. The traditional undecidibility results will be covered, along with the attempts to overcome the resulting limitations in restricted situations. Mechanical theorem provers will be considered. The resolution and unification predicate calculus methods will be discussed along with appropriate PROLOG programming assignments. The Boyer-Moore approach will be discussed, along with LISP programming assignments.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(508) 999-8000
-
Regional Accreditation:
-
New England Association of Schools and Colleges
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.