| Spring Term 2020 Theory of Computation - 3153 - CMSC 515 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
Prerequisites/Notes: CMSC 150 and MATH 230 Catalog Description : A study of programming in the abstract, leading to an understanding of the precise nature and limitations of computing machines. Topics include universal computing machines such as Turing machines, decidable and undecidable predicates, regular and pushdown automata, and regular and context-free grammars. PREREQUISITES: CMSC 150 and MATH 230 Attributes: 400-599 Advanced Course
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||
