Post correspondence problem (PCP)
Generated by GPT-5-miniExpansion Funnel Raw 63 → Dedup 0 → NER 0 → Enqueued 0
| Post correspondence problem (PCP) | |
|---|---|
| Name | Post correspondence problem |
| Field | Computability theory |
| Introduced | 1946 |
| Inventor | Emil Post |
Post correspondence problem (PCP) is a decision problem in computability theory concerning the existence of matching sequences from a finite set of tile-like pairs of strings over a finite alphabet. It arose in the work of Emil Post and is a canonical example of an undecidable problem alongside Halting problem and Hilbert's tenth problem. PCP played a formative role in the development of recursion theory, formal language theory, and reductions used in proofs by Alonzo Church, Alan Turing, and researchers associated with Princeton University and Institute for Advanced Study.
Definition
Given a finite list of pairs (dominoes) (u1,v1), (u2,v2), ..., (un,vn) where each ui and vi are nonempty strings over a finite alphabet Σ, the Post correspondence problem asks whether there exists a nonempty sequence of indices i1,i2,...,ik such that the concatenation ui1 ui2 ... uik equals vi1 vi2 ... vik. The standard decision formulation is: does a match exist? This problem is studied in the context of Turing machine decidability, reductions from semi-decidability and recursive enumerability frameworks, and comparisons with problems like Word problem for groups and Mortality problem.
Examples
Simple instances illustrate the matching requirement: with tiles (a,ab) and (ba,a), one can attempt sequences to align concatenations; concrete small examples are used in textbooks associated with Alfred Aho, John Hopcroft, and Jeffrey Ullman. Educational constructions appear in lecture notes from Massachusetts Institute of Technology and Stanford University courses that also reference canonical problems like Post's problem and Rice's theorem. Historical examples in Post's original papers were contemporaneous with work by Emil Post and referenced by scholars at Harvard University and Princeton University.
Decidability and Undecidability
Post proved that PCP is undecidable: there exists no algorithm that, given an arbitrary finite set of string pairs, always correctly decides whether a matching sequence exists. This result parallels undecidability proofs such as for the Halting problem by Alan Turing and relies on reductions from known undecidable problems developed in the milieu of Hilbert's problems and work by Kurt Gödel. PCP is recursively enumerable in some formulations but not recursive, linking it to themes studied by Stephen Cole Kleene and Noam Chomsky. Variants restricted to two-letter alphabets or bounded tile sets yield distinctions similar to results for the Post Correspondence Problem over a binary alphabet treated in literature from University of California, Berkeley and University of Oxford research groups.
Variants and Related Problems
Several variants modify alphabet size, allow empty strings, or impose bounded concatenation length. The modified PCP over a binary alphabet, the bounded Post correspondence problem, and the marked Post correspondence problem are studied alongside the PCP with unique decipherability constraints in contexts linked to Claude Shannon's coding theory and problems like the Word problem for semigroups and the Conjugacy problem in group theory. Related decision problems include the Mortality problem for matrices, the Uniform word problem in monoids studied at University of Illinois Urbana–Champaign, and matching problems in automata theory explored by researchers at Carnegie Mellon University and Technische Universität Berlin.
Proofs and Reductions
Undecidability proofs for PCP typically reduce from the Halting problem or from the emptiness problem for Linearly bounded automatons and make constructive encodings of Turing machine computations into string pairs. Classic constructions appear in expositions by Michael Sipser, John Myhill, and Hartley Rogers Jr. and are taught in courses at Cornell University and École Normale Supérieure. Reductions connect PCP to the Post canonical system and use combinatorial encodings similar to reductions used by Martin Davis and Hilary Putnam. Advanced proofs employ techniques from combinatorics on words developed by researchers at Université Paris-Sud and University of Vienna.
Applications and Implications
Although PCP is undecidable, its study informs practical domains where matching of sequences is central: algorithmic analysis of formal languages in compilers at institutions like Bell Labs and IBM Research, verification problems in model checking research groups at Microsoft Research and ETH Zurich, and synthesis tasks in programming languages theory linked to work by Robin Milner and Yves Bertot. PCP's undecidability results illustrate limits on automated theorem proving central to discussions at Association for Computing Machinery conferences and influence complexity-theoretic perspectives in venues such as Symposium on Theory of Computing and International Colloquium on Automata, Languages and Programming.