Description
Cook-Levin Theorem and PSPACE-L23
2007-12-2101:10:47
Conclusion-L24
2007-12-2141:50
NP-Completeness-L22
2007-12-2101:14:27
NP-L21
2007-12-2101:10:55
Polynomial Time-L20
2007-12-2001:14:09
Computational Complexity-L19
2007-12-2001:08:03
Reductions and Rice's Theorem-L17
2007-12-2001:11:04
Undecidable Problems and Unprovable Theorems-L18
2007-12-2001:00:01
Undecidability-L16
2007-12-1801:03:39
Pushdown Automata-L10
2007-12-1001:07:28
Decidability and a Universal Turing Machine-L15
2007-12-1001:14:40
Church's Thesis-L14
2007-12-1001:12:10
Turing Machines-L13
2007-12-1059:38
Context-Free Recognition-L12
2007-12-1001:02:07
CFL Closure Properties, Non-CF Languages-L11
2007-12-1001:00:22
Context-Free Grammars-L09
2007-12-1001:05:54
Non-Regular Languages-L08
2007-12-1001:01:34
Countability and Uncountability-L07
2007-12-1041:54
Regular Expressions-L06
2007-12-1001:09:45
Nondeterministic Finite Automata-L05
2007-12-0401:10:26
0.5x
0.8x
1.0x
1.25x
1.5x
2.0x
3.0x
Sleep Timer
Off
End of Episode
5 Minutes
10 Minutes
15 Minutes
30 Minutes
45 Minutes
60 Minutes
120 Minutes
United States
United StatesUnited States