In the field of computational complexity theory, the concept of decidability plays a fundamental role. A language is said to be decidable if there exists a Turing machine (TM) that can determine, for any given input, whether it belongs to the language or not. The decidability of a language is a important property, as it