Proof of `The Post correspondence problem is undecidable`
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The Post correspondence problem over is undecidable: glued from the reduction and the undecidability of acceptance for tape machines, taken as assumptions.