The Post Correspondence Problem Neso Academy

TOC: The Post Correspondence Problem
Topics discussed:
1. The Post Correspondence Problem
2. Examples of The Post Correspondence Problem
3. Undecidability of The Post Correspondence Problem

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]

Best comment

1. Easy Engineering Concepts: Thanks
2. ashritha bs: Great!
3. axle blaxe: Very nice explanation sir !!
4. Mitchel Paulin: Yes, PCP is turing recognizable since you can perform a BFS on all possible combinations and it will halt eventually if there is an answer
5. Anees Fatima: What if two dominos have first two same numerator and denominator
6. Mitchel Paulin: Then we found a solution to that particular instance of the problem
7. Jorge Chavez: You literally guaranteed me 25% on my final. Thanks!
8. Yunxiang LI: You really saved my life!
9. Denis Grebennicov: Thanks! It helped. So it's not decidable, but it is recognizable, right?

The Post Correspondence Problem
43,735 views views	468,989 followers
242 Likes	242 Dislikes
Education	Upload TimePublished on 7 Feb 2018