THEORY OF COMPUTATION
PRE-REQ: Check the SCI Website
Course DescriptionThis 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.
Credits:3View this course on Pitt's Website
Add your review by filling out this form!