Show that Turing-decidable languages are closed under set difference

1.6k Views Asked by At

Can we use the proof of turing-decidable languages being closed under complement to show that turing-decidable languages are closed under set difference?