Post Correspondence Problem (PCP) is Undecidable Proof

Here we prove that the Post Correspondence Problem is undecidable by embedding a Turing Machine running on an input w into the tiles.
Easy Theory Website: www.easytheory...
Become a member: / @easytheory
Donation (appears on streams): streamlabs.com...
Paypal: paypal.me/easy...
Patreon: / easytheory
Discord: / discord
#easytheory
KZbin Live Streaming (Sundays) - subscribe for when these occur.
Social Media:
Facebook Page: / easytheory
Facebook group: / easytheory
Twitter: / easytheory
Merch:
Language Hierarchy Apparel: teespring.com/...
Pumping Lemma Apparel: teespring.com/...
If you like this content, please consider subscribing to my channel: / @easytheory
Gold Supporters: Micah Wood
Silver Supporters: Timmy Gy
▶SEND ME THEORY QUESTIONS◀
[e-mail]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.