ConceptTheory & Algos
Turing-recognizability of PCP
PCP is Turing-recognizable because we can systematically search and try all possible combinations of dominos until a match is found.
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.