On an old worksheet I came across the question
If L1 and L2 are two Turing decidable languages, then show that 𝐿1∪𝐿2 and 𝐿1𝑜𝐿2 are Turing decidable languages (high-level description with stages is enough).
How do I go about answering this without being given a language to work from?