ConceptTheory & Algos
Mapping reducibility
Language A is mapping-reducible to language B if there exists a computable function that maps strings in A to strings in B and strings not in A to strings not in 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.
Turing machine2Computable function1Decidability1Language1Language decidability1Recognizability1Reducibility1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
4Connections
14The lectures that define it or assume it, and the concepts next to it.