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.