THE KING'S UNIVERSITY
COLLEGETHE KING'S UNIVERSITY
COLLEGE| COURSE NUMBER: | MATH 430 | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| COURSE TITLE: | Theory Of Computing | |||||||||||||
| NAME OF INSTRUCTOR: | Dr. Amy Feaver | |||||||||||||
| CREDIT WEIGHT AND WEEKLY TIME DISTRIBUTION: | credits 3(hrs lect 3 - hrs sem 0 - hrs lab 0) | |||||||||||||
| COURSE DESCRIPTION: | An introduction into advanced topics in the theory of
computation. Topics include: models of computers including finite
automata and Turing machines, computability, computational complexity,
basics of formal languages. Same as CMPT 430. Prerequisites: CMPT/MATH 360 |
|||||||||||||
| REQUIRED TEXTS: | Anil Maheshwari and Michael Smid, Introduction to the Theory of Computing; book is creative commons and linked to on the Moodle site. | |||||||||||||
| MARK DISTRIBUTION IN PERCENT: |
|
|||||||||||||
| COURSE OBJECTIVES: | This course is designed to introduce the student to the central concepts in the theory of Computing Science. The topics covered will include finite automata, context-free languages, Turing machines, Undecidability and Computational Complexity. This course is supported by a weekly seminar in which students will be responsible for presenting and discussing current papers in this field. | |||||||||||||
| COURSE TOPICS: |
|
|||||||||||||
Required texts, assignments, and grade distributions
may vary
from one offering of this course to the next. Please consult
the course instructor for up to date details.
© The King's University College
Maintained By Glenn
J Keeler, Registrar