1. A turing machine prints a specific letter .
2.If L is CFL then L' is also CFL .
For the second one ,it is known that L' will not be CFL but then why can't we design any algorithm for it ,since it is true that complement of CFL will never be true so then what is the essence here with respect to talking about decidable and undecidable ?