RSS Amplifier

Video feed

MIT 18.404J Theory of Computation, Fall 2020

youtube.com ↗Source feed ↗15 videos

Subscribe:.rss.atom.json.md

Dormant Last read · last published · next check
Read 20 hours ago and current, but nothing has been published for 5 years.

Written by

Latest videos

Saves to your Watch queue, to pick up on another day or another device.

1. Introduction, Finite Automata, Regular Expressions

Play

5. CF Pumping Lemma, Turing Machines

Play

3. Regular Pumping Lemma, Conversion of FA to Regular Expressions

Play

9. Reducibility

Play

14. P and NP, SAT, Poly-Time Reducibility

Play

7. Decision Problems for Automata and Grammars

Play

12. Time Complexity

Play

6. TM Variants, Church-Turing Thesis

Play

8. Undecidability

Play

11. Recursion Theorem and Logic

Play

2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA

4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion

10. Computation History Method

15. NP-Completeness

16. Cook-Levin Theorem