If L1 is undecidable and L1 is included in L2, is L2 also undecidable and why?

79 Views Asked by At

If you could reduce L1 to L2 then L2 would be undeciable of course. But I am wondering if you could really recude in all cases. Thanks for all kind of help

1

There are 1 best solutions below

0
On

No. Every language is a subset of the language containing all strings, which is trivially decidable.