Decidability (logic)
= Decidability (logic)
{wiki=Decidability_(logic)}
In logic and computer science, **decidability** refers to the ability to determine, algorithmically, whether a given statement or problem can be definitively resolved as true or false within a specific formal system. A problem is said to be **decidable** if there exists an algorithm (or computational procedure) that will always produce a correct yes or no answer after a finite number of steps.