Post Correspondence Problem (PCP) is Undecidable Proof

10,501 views

About this video

Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: What are your favorite Comp Sci YouTube channels? · 84% confidence

Proves the Post Correspondence Problem undecidable by reduction from Turing-machine acceptance, constructing the domino set step by step in a 30-minute lecture.

Proof that the Post Correspondence Problem is undecidable.

Video by Easy Theory, played through YouTube's embedded player.

Part of Undecidable Languages - Easy Theory, "Intro" Theory of Computation Lectures - Easy Theory