ConceptTheory & Algos
Turing-unrecognizability proof template
To prove B is Turing-unrecognizable, show that a known Turing-unrecognizable language A is mapping reducible to B.
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.
Mapping reducibility1Turing-unrecognizability1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.