CS 465 - Topics: Computing Theory

(1-3 S.H.)

Topics are selected from automata theory, the Turing Machine, combinatorics, etc. An in-depth view of a specific concept of computing is covered. Prerequisites: Junior or senior standing and instructor’s permission. Grade or P/NC. Offered when demand warrants. May be repeated for credit.

Course Registration

Print this Page