Info

MATH-350 Theory of Computation

MATH-350 Course Info

Coure Description & Learning Goals

A theory course in automata, computability and complexity that addresses two questions:

  • What are the fundamental capabilities and limitations of computers?
  • What makes some problems computationally hard and others easy?

Students will learn...

  1. to develop reasoning abilities.
  2. to appreciate the beauty of mathematical reasoning and the power & clarity of thought it can give us.
  3. to apply theory to problems in computer science.
  4. to learn about and appreciate the theoretical foundation of computer science.
Requirements

To be successful in this course student are required to...

  • Complete the required weekly reading
  • Attend every class
  • Participate fully in guided classroom lab activities
  • Reviewing textbook material and lab activities to prepare for course Quests
  • Complete 4 course Quests. Three will be given in the evening during the semester and one will be schedule for final exam week.