Post Correspondence Problem PCP is Undecidable Proof

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=8BXxptA3WPE

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: https://www.easytheory.org • Become a member: / @easytheory • Donation (appears on streams): https://streamlabs.com/easytheory1/tip • Paypal: https://paypal.me/easytheory • Patreon: / easytheory • Discord: / discord • #easytheory • Youtube Live Streaming (Sundays) - subscribe for when these occur. • Social Media: • Facebook Page: / easytheory • Facebook group: / easytheory • Twitter: / easytheory • Merch: • Language Hierarchy Apparel: https://teespring.com/language-hierar... • Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f... • If you like this content, please consider subscribing to my channel: / @easytheory • Gold Supporters: Micah Wood • Silver Supporters: Timmy Gy • ▶SEND ME THEORY QUESTIONS◀ • [email protected] • ▶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.

#############################

New on site