Course Title: Computing Theory
Week 1: Formal languages, Regular Expressions, Grammars, Week 2: Finite State Machines, Week 3: Pushdown Automata, Nondeterminism, Week 4: Turing Machines, Week 5: Computability, Halting Problem, Universal Turing Machines, Week 6: Pumping Lemma, NFA -> DFA conversion, Week 7: Chomsky Hierarchy, Week 8: Unrestricted Grammars, Week 9: Complexity and intractability, Week 10: NP-completeness,Week 11: Probabilistic algorithms, zero-knowledge proofs, quantum computing, Week 12: Research and requests