Easy Theory

Real Professor's College Grades 👀

Why is the Halting Problem Undecidable?

Towers of Hanoi using RECURSION TWICE!

DFA Minimization

Undecidability in 2 Hours (A_TM, Rices Theorem, LBAs, EQ_CFG)

Asymptotic Analysis and Runtime - Easy Theory

Acceptance for Turing Machines is Undecidable, but Recognizable

Regularity in Turing Machines is Undecidable

Parse Trees and CFGs in Chomsky Normal Form

Regex for Regexes...What?!

Do(L) vs. Sq(L) - Are they Equal? Which is Regular?

Emptiness for Turing Machines is Undecidable

Rices Theorem (Undecidability): 5 Proofs and Examples

Rices Theorem Example: Emptiness for Turing Machines

My Students Disproved a Conjecture

Introduction to the Theory of Computation (Full Course)

Chomsky Normal Form - what is it?

Relatively Prime is in P

My Responses to Why You Hate Theoretical Computer Science

Complexity Theory Professors Be Like

Theory Computer Science Professors Be Like (Part 2)

Multiplying x * y Using RECURSION

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

Algorithms #15: Dynamic Programming - Problem Set #4 - Easy Theory

What are Grammars (in Theory of Computation)?

What is Dijkstras Algorithm? - Easy Theory

10 Reasons Why Computer Science Theory is Important

What is the Totally Quantified Boolean Formula (TQBF) problem?

How to Union two Regular Languages with the Product Construction - Easy Theory

What is Theoretical Computer Science?

Amazon Coding Interview: Is this a Binary Search Tree?

Simple Conversions (DFA to NFA to PDA, RG to CFG)

Conversion of NFA to DFA Examples (Powerset Construction)

Chomsky Normal Form (CNF) Conversion Example

How to Use Rices Theorem in 5 Minutes

Chomsky Normal Form Conversion Example

The Star of ANY Unary Language is Regular?!

Undecidable Language Example: Moving Left Three Times in a Row

Undecidable Languages NOT Closed Under Concatenation

Is this language recognizable?

Acceptance for Regular Expressions is Decidable

All languages are regular?! Spot the Proof Error(s)!

ε-closure: what is it? (epsilon closure)

Closure Properties of Non-Regular Languages

Deterministic Context-Free Languages Closed under Complement

Turning 30

How to Become a Professor in 6 Steps

Planar Machines in Theory

ChatGPT vs. Professors Computer Science Exam

Which of these languages is undecidable?

Regular Expression (Regex) to NFA Example Conversion