AI 212 Theory of Computing

A systematic study of computing. Topics include Finite Automata, Fundamentals of computer programming languages and grammar, Regular Languages, Context-Free and Context-Sensitive Languages, Turing machines, and Computability Theory. The class introduces the concepts of Computer Problems, Decidability, Reducibility, Intractability, and Computational Complexity.