|
|||
CS 2110 - THEORY OF COMPUTATIONMinimum Credits: 3 Maximum Credits: 3 This course deals with computability theory, automata theory and formal languages. Various models of computation will be examined, their relations to each other and their properties will be studied. Topics include models for computable functions and church's thesis, models for recognizers and their relation to formal grammars, algorithmically solvable and unsolvable problems, and the complexity of computations. Academic Career: Graduate Course Component: Lecture Grade Component: Grad LG/SNC Basis Course Requirements: PLAN: Computer Science (CS-PHD; CS-MS; CSMSBS-MS) or Computer Engineering (COEAS-PHD; COEAS-MS; COEENG-PHD; COEENG-MCO)
|
|||
All catalogs © 2024 University of Pittsburgh. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|