The Course Provides An Introduction to Computatbility and Complexity, Including: Deterministic Automaton and Regular Languages, Nondeterministic Automaton, Context-Free Languages and Push-Down Automaton, Algorithms on Automata, Turing Machine, and Decidability. in Complexity Theory the Course Covers the Classes P, Np, Np-Hard, Np-Complete, and Pspace. at the End of the Course the Students
1. Will Know Fundamental Concepts in Computability, Including Automata Theory, Turing Machines, Regular Languages and Decidability.
2. Will Know Fundamental Concepts in Complexity Theory, Including the Major Complexity Classes of P, Np, Np-C and Pspace.
3. Will Know How to Prove Membership of a Problem in a Complexity Class, and How to Prove That a Problem Is Decidable Or Undecidable.
4. Will Be Familiar with the Argument of Why the Number of Decidable Problems Is Countable, Whereas the Number of Undecidable Problems Is Uncountable.