Lecture 18 (Computation Theory) Undecidable Problems and Mapping Reducibility

In the course's convention, "A reduces to B" intuitively means that:

1. A.A solution to B would give you a solution to A
2. B.A solution to A would give you a solution to B
3. C.A and B must be the same problem up to relabeling
4. D.A and B are both guaranteed to be decidable