University of Portland Bulletin 2025-2026

CS 357 Theory of Computation

Introduction to finite automata, Turing machines, formal languages, computability, and complexity.

Prerequisite

CS 305 with a grade of C- or better, MTH 311 with a grade of C- or better.
  • Up one level
  • 300