Loading course details…
Loading course details…
Taylor University · 3 credits · UGRD

A theoretical treatment of what can be computed and how efficiently computation can be done. Topics include models of computation and automata, deterministic and non-deterministic computations, and formal language theory. Prerequisite: COS 265
Fall 2026 · 1 section
Aug 31 – Dec 17
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 1Class #20355 | Tu Th · 2:00 – 3:20 PM | Euler Science Complex 200 | Trudel, Grant |
| 1 notes: Instructional method: Lecture | |||