Lecture 33/65: More Decidable Problems For DFAs

Lecture 26/65: The Church-Turing Thesis

Regularity in Turing Machines is Undecidable

L11: Church-Turing Thesis and Examples of Decidable Languages

Lecture 29/65: Nondeterminism in Turing Machines

Turing & The Halting Problem - Computerphile

Lecture 11/65: Pumping Lemma (For Regular Languages)

Acceptance for Turing Machines is Undecidable, but Recognizable

Turing Complete - Computerphile

The World's Best Mathematician (*) - Numberphile

Kaprekar's Constant

The Halting Problem: The Unsolvable Problem

Undecidable Problems: Reducibility (Part 1) | What are Reductions?

The Story of Shor's Algorithm, Straight From the Source | Peter Shor

Leonard Susskind on Richard Feynman, the Holographic Principle, and Unanswered Questions in Physics

Emptiness for Turing Machines is Undecidable

Lecture 40/65: Reducibility: A Technique for Proving Undecidability

P vs. NP and the Computational Complexity Zoo

Why is the Halting Problem Undecidable?