|
|||
CPSC 5200 - Automata, Complexity, and Computability(3) Credit Hours An introduction to the classical and contemporary theory of computation including automata, formal languages, Turing machines, recursive functions, computability and uncomputability, complexity and the classes of P and NP. Prerequisite: Department Head approval. Differential Course Fee will be assessed. |
|||
All catalogs © 2023 University of Tennessee Chattanooga. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|