L17: Using reductions to prove language undecidable

Published: Nov. 15, 2011, 8 a.m.

b'Proving additional languages are not decidable, by using reductions.'