prove every language got a language that is harder
The halting problem for a class of machines that can decide&nbsp;$L$ is always harder than&nbsp;$L$. You already know this when $L$&nbsp;is computable and the proof of the more general result is essentially the same. For every&nbsp;$L$, you need to think of a class of machines that can decide&nbsp;$L$.