Is the decidability of a language decidable? Is there a Turing machine that takes a language as input and decides/semi-decides if it is a decidable language?

Comments + answer say trivially the answer is yes; however, I'm wondering here would it be possible without the use of excluded middle to construct such a machine.
Sure.
There are Turing machines that always reject or always accept...
So, one of them is surely correct...