TOC: Undecidability of the Post Correspondence Problem
Topics discussed:
This lecture shows how to prove that the PCP is undecidable. The acceptance problem of a TM is taken and reduced to a PCP to prove that the PCP is also undecidable.

Link to the Lecture where CONFIGURATION OF TM is discussed: https://youtu.be/gQnPM6sydkk

Contribute: http://www.nesoacademy.org/donate

Website ► http://www.nesoacademy.org/
Forum ► http://forum.nesoacademy.org/
Facebook ► https://goo.gl/Nt0PmB
Twitter ► https://twitter.com/nesoacademy
Pinterest ► http://www.pinterest.com/nesoacademy/

Music:
Axol x Alex Skrindo - You [NCS Release]