CSCI482 (496): Theory of Computation

I. Course prefix and number CSCI482 (496)
II. Number of semesters hours 3
III. Pre-requisites This is actually being taught as a topics course
IV. Location of classroom and time course meets Location TBD time TH 4:00PM 5:15PM
V. Instructor name
Office location
Phone
Email address
Web page
Dr. Warren MacEvoy
Wubben 186
248-1070
[email protected]
http://www.mesastate.edu/~wmacevoy
VI. Office hours See my home page
VII. Course Description

This course will discuss the classical theory of computation: computability, regular expressions, automata, turing machines, grammars and mu-recursive functions. Highlights will include the Church-Turing thesis, equivalency of computational models, and the halting problem.

VIII. Textbook and materials Elements of the Theory of Computation by Lewis and Papadimitriou, 1981 (Prentice Hall) edition.
IX. Course Objectives See course description.

X. Methods

Lectures, lectures, lectures. Students will be expected to present some of the topic materials. This is very much a theory class, but we will keep the discussion lively with a goal of understanding some of the deepest results in computer science.

XI. Policy on absences and tardies

Make up exams will only be given with advanced notification or very unusual circumstances. You are responsible for material given in class, including changes of schedule for exams.

XII. Policy on late work

Late projects cost two letter grades per day.

XIII. Policy on academic dishonesty

Cheating will result in the instructor's withdrawl of the student with a "fail" grade.

XIV. Disability Arrangements

If you wish to have accomodations made for some disability, you must inform Eduational Access Services at 248-1826 and the instructor in advance.

XV. Evaluation and grading

Your grade will be reflected by your participation in classroom lectures and discussion, as well as your own lectures on the subject matter.

XVI. Major Assignments

TBD

XVII. Course Outline Chapters 1 through 6 of the textbook.