Decidability

Home > Computer Science > Theory of Computation > Turing Machines > Decidability

A language is said to be decidable if there exists an algorithm that can determine whether any given word belongs to that language.