Post Correspondence Problem over Binary Alphabets is Undecidable

Pubblicato il: 21 gennaio 2021
sul canale di: Easy Theory

2,683

Here we show that the Post Correspondence Problem over binary alphabets is undecidable using homomorphisms.

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.

In questa pagina del sito puoi guardare il video online Post Correspondence Problem over Binary Alphabets is Undecidable della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 21 gennaio 2021, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 2,683 volte e gli è piaciuto 45 spettatori. Buona visione!