Post Correspondence Problem (PCP) is Undecidable Proof

Published: 01 January 1970
on channel: Easy Theory

6,401

111

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.

On this page of the site you can watch the video online Post Correspondence Problem (PCP) is Undecidable Proof with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 01 January 1970, share the link with friends and acquaintances, this video has already been watched 6,401 times on youtube and it was liked by 111 viewers. Enjoy your viewing!

2,474

106