ConceptTheory & Algos
Undecidability of PCP
The Post Correspondence Problem is undecidable, meaning no Turing machine can decide whether a given set of dominos has a match.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.