Get the latest tech news
The Post Correspondence Programming Language: Domino-oriented Programming (2015)
Suppose you are given infinitely many of each of the following dominos: Can you find a way to arrange some of the dominos so that the sequence of dots on top row matches the bottom row? Here is one possible solution: This list of dominos is called a match since reading off the top row we get which is the same as reading off the bottom row. Determining whether a collection of dominos has a match is known as the Post Correspondence Problem, or PCP for short.
None
Or read this on Hacker News
