Easy Theory

Videos from Easy Theory

Page 2 of 3 • 58 total videos

Understanding Polynomial-Time Reduction in NP-Hard and NP-Complete Problems
8:56

Understanding Polynomial-Time Reduction in NP-Hard and NP-Complete Problems

Easy Theory
65.0K views
Bonus Video: 5 Open Problems about Context-Free Languages - Easy Theory
8:31

Bonus Video: 5 Open Problems about Context-Free Languages - Easy Theory

Easy Theory
383 views
Mapping Reducibility + Reductions, what are they?
8:12

Mapping Reducibility + Reductions, what are they?

Easy Theory
34.2K views
What is Time (in complexity theory)? - Easy Theory
9:01

What is Time (in complexity theory)? - Easy Theory

Easy Theory
6.3K views
What is Complexity Theory?
10:06

What is Complexity Theory?

Easy Theory
30.9K views
Universality for Context-Free Grammars is Undecidable
18:20

Universality for Context-Free Grammars is Undecidable

Easy Theory
4.1K views
Undecidability of the Emptiness Problem for Turing Machines
9:00

Undecidability of the Emptiness Problem for Turing Machines

Easy Theory
23.7K views
Acceptance for Turing Machines is Undecidable, but Recognizable
12:07

Acceptance for Turing Machines is Undecidable, but Recognizable

Easy Theory
50.4K views
What is an encoding, and why should we care?
12:50

What is an encoding, and why should we care?

Easy Theory
6.0K views
Multi-Tape Turing Machines
25:13

Multi-Tape Turing Machines

Easy Theory
20.4K views
Turing Machine Definitions: Configuration, Computation, Yields, Halting
13:28

Turing Machine Definitions: Configuration, Computation, Yields, Halting

Easy Theory
23.2K views
Turing Machine Example and Computation (Can you guess what it does?)
19:18

Turing Machine Example and Computation (Can you guess what it does?)

Easy Theory
64.4K views
Turing Machines - what are they? + Formal Definition
18:30

Turing Machines - what are they? + Formal Definition

Easy Theory
55.9K views
Comprehensive Overview of Context-Free Languages in 3.5 Hours
3:25:25

Comprehensive Overview of Context-Free Languages in 3.5 Hours

Easy Theory
38.4K views
Regular Languages in 4 Hours (DFA, NFA, Regex, Pumping Lemma, all conversions)
3:53:22

Regular Languages in 4 Hours (DFA, NFA, Regex, Pumping Lemma, all conversions)

Easy Theory
41.6K views
Example of Converting Pushdown Automaton to Context-Free Grammar
19:22

Example of Converting Pushdown Automaton to Context-Free Grammar

Easy Theory
38.8K views
Conversion of Pushdown Automaton to Context-Free Grammar (PDA to CFG)
22:18

Conversion of Pushdown Automaton to Context-Free Grammar (PDA to CFG)

Easy Theory
38.6K views
Pushdown Automaton (PDA) for Non-Regular Language {0^n 1^n}
11:16

Pushdown Automaton (PDA) for Non-Regular Language {0^n 1^n}

Easy Theory
100.3K views
What is a Pushdown Automaton (PDA)?
12:11

What is a Pushdown Automaton (PDA)?

Easy Theory
149.1K views
Understanding Context-Free Grammar and Its Languages
17:55

Understanding Context-Free Grammar and Its Languages

Easy Theory
176.0K views
What are Grammars (in Theory of Computation)?
12:49

What are Grammars (in Theory of Computation)?

Easy Theory
20.3K views
Pumping Lemma for Regular Languages FULL PROOF
23:48

Pumping Lemma for Regular Languages FULL PROOF

Easy Theory
34.7K views
Are there Non-Regular Languages?
9:15

Are there Non-Regular Languages?

Easy Theory
3.1K views
100 MORE Algorithm Exam Solutions - Easy Theory
3:25:41

100 MORE Algorithm Exam Solutions - Easy Theory

Easy Theory
1.6K views