The Post Correspondence Problem (PCP)
In this video, we discuss another Turing complete computation model which is based on dominoes. It is known as the Post Correspondence Problem, or PCP for short. PCP is interesting because we can study several PCP variants. Some of these variants are powerful enough to include undecidable problems, others are NP-complete, and others can be solved efficiently with a simple algorithm. So PCP nicely spans the whole spectrum of computation.
Watch video The Post Correspondence Problem (PCP) online without registration, duration hours minute second in high quality. This video was added by user Computational Thinking 14 December 2022, don't forget to share it with your friends and acquaintances, it has been viewed on our site 2,550 once and liked it 62 people.