Easy Theory

Videos from Easy Theory

Page 1 of 3 • 58 total videos

Fourteen DFA Examples? No Problem!
38:44

Fourteen DFA Examples? No Problem!

Easy Theory
32.4K views
Top 5 Tips for Theory Computer Science #shorts
0:26

Top 5 Tips for Theory Computer Science #shorts

Easy Theory
8.7K views
Undecidability of the Emptiness Problem for Turing Machines via Rice's Theorem
4:31

Undecidability of the Emptiness Problem for Turing Machines via Rice's Theorem

Easy Theory
4.0K views
Conversion of Context-Free Grammar to Pushdown Automaton
24:21

Conversion of Context-Free Grammar to Pushdown Automaton

Easy Theory
70.3K views
Busy Beaver #4 Turing Machine Simulation
3:21

Busy Beaver #4 Turing Machine Simulation

Easy Theory
2.4K views
Turing Machine Example: a^n b^n c^n
14:41

Turing Machine Example: a^n b^n c^n

Easy Theory
43.7K views
Concerns Regarding Pushdown Automata and Turing Machines
6:48

Concerns Regarding Pushdown Automata and Turing Machines

Easy Theory
2.4K views
DFA Minimization Algorithm + Example
21:12

DFA Minimization Algorithm + Example

Easy Theory
30.0K views
What is Theoretical Computer Science?
31:32

What is Theoretical Computer Science?

Easy Theory
56.3K views
How I Published a Paper in Theoretical Computer Science
10:50

How I Published a Paper in Theoretical Computer Science

Easy Theory
2.5K views
"I Hate Theory of Computer Science" - why? #shorts
0:40

"I Hate Theory of Computer Science" - why? #shorts

Easy Theory
13.7K views
Complexity Theory Professors Be Like
2:13

Complexity Theory Professors Be Like

Easy Theory
3.5K views
Theory Computer Science Professors Be Like (Part 2)
4:58

Theory Computer Science Professors Be Like (Part 2)

Easy Theory
3.4K views
Theory Computer Science Professors Be Like (Parody)
2:39

Theory Computer Science Professors Be Like (Parody)

Easy Theory
30.1K views
Simplifying Computers | Essence of Theoretical Computer Science #2
21:01

Simplifying Computers | Essence of Theoretical Computer Science #2

Easy Theory
1.6K views
Deterministic Finite Automaton to Turing Machine Conversion (DFA to TM)
11:58

Deterministic Finite Automaton to Turing Machine Conversion (DFA to TM)

Easy Theory
10.5K views
Limits of computers | Essence of Theoretical Computer Science #1
15:29

Limits of computers | Essence of Theoretical Computer Science #1

Easy Theory
15.7K views
Regex to NFA Conversion Isn't Hard! (Sipser 1.28a)
9:15

Regex to NFA Conversion Isn't Hard! (Sipser 1.28a)

Easy Theory
89.4K views
Directed Hamiltonian Path is NP-Complete via 3SAT Reduction
22:46

Directed Hamiltonian Path is NP-Complete via 3SAT Reduction

Easy Theory
42.9K views
It's Impossible to Deal with So Much Space
7:33

It's Impossible to Deal with So Much Space

Easy Theory
426 views
What is Space? (for complexity theory) - Easy Theory
10:00

What is Space? (for complexity theory) - Easy Theory

Easy Theory
1.6K views
Pumping Lemma for Regular Languages - 20 Examples
2:21:21

Pumping Lemma for Regular Languages - 20 Examples

Easy Theory
182.3K views
What is a regular language? + Examples
7:34

What is a regular language? + Examples

Easy Theory
3.3K views
How to Not Swear with Regular Languages - Easy Theory
11:10

How to Not Swear with Regular Languages - Easy Theory

Easy Theory
350 views