besluttelig
Besluttelig is a term used in Norwegian-language logic and computer science to describe a decision problem that can be resolved algorithmically. An instance of a besluttelig problem admits a finite procedure that, for any input, halts and returns a correct yes or no answer. In English, the term is commonly rendered as decidable. The related noun is besluttelighet.
Besluttelighet is a central notion in computability theory and formal language theory. A problem or language
In Norwegian usage, besluttelighet is a foundational concept in the study of algorithms and formal systems.