: capable of being decided specifically : capable of being decided as following or not following from the axioms of a logical system Was logic complete … ? And was it decidable, in the sense that there was a method that demonstrated the truth or falsity of every statement? —

What is computability and Decidability?

If TM halts on valid Input.. that is if the problem is having a logic(Algorithm) then it is computable.. computability comes under REL. If TM halts on any input (valid or invalid).. It is a Halting TM. Then it is decidability.

How do you calculate Decidability?

To show that a language is decidable, we need to create a Turing machine which will halt on any input string from the language's alphabet. Since M is a dfa, we already have the Turing Machine and just need to show that the dfa halts on every input.