Theory of Computation: Lecture 21

Theory of Computation: Lecture 21. The main topics covered in this lesson include: big-Oh notation; little-o notation; time complexity classes; non-deterministic TMs; the class P; resource bounded computations; non-deterministic finite automata; non-deterministic pushdown automata;...