MATH 421: Theory of Computation

Syllabus

Class Nbr. 1932
Mode of delivery: synchronous online
Meeting: MTW F,   2 - 2:50pm   via Canvas
 
Text: Introduction to the Theory of Computation (3rd Ed.) by M. Sipser (ISBN-13: 978-1-133-18779-0)
 
Prerequisites: MATH 320
 
Instructor: Dr. Sergei Bezrukov   Office:  SW3022   Schedule and Office hours
  Tel.: 394-8523  E-mail: sbezruko@uwsuper.edu

Catalog Description

Thorough introduction to automata, formal languages, and computability. Topics include: models of computation; regular and context-free languages; finite and pushdown automata; Turing machines; unsolvable decision problems; and fundamentals of computational complexity.


Learning Objectives

Students will learn how to model computational devices, up to and including a modern electronic computer, using standard techniques of computer science. Students will be able to state, explain, and prove various capabilities and limitations of computing devices based on these models. Students will be able to work with time and space complexity, and understand the standard categories of computational complexity.


Course Outcomes


Evaluation and Grading


Class Policies

Class Attendance

Suggestions for Success in Class


University Policies

Please refer to the University Catalog or the UW-Superior Web page for full description of these and other policies.