Question: Every language/problem is either decidable or undecidable. Suppose that you have two languages L1 and L2. Suppose further that you know that L1
Every language/problem is either decidable or undecidable. Suppose that you have two languages L1 and L2. Suppose further that you know that L1 <= L2 (i.e., L1 reduces to L2 ). If you know that L1 is decidable, what, if anything, can you conclude about the decidability of L2?
Thanks a lot for your help!1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
