Post correspondence problem

Layer 0 — Mathematicsin the recursion-theory subtree

Post 1946: undecidable problem about matching tile-sequences. Used to show undecidability of CFG-ambiguity, semi-Thue word-problems. Foundation of reduction-techniques.

Related concepts

Explore Post correspondence problem on the interactive knowledge graph →