Accueil > Term: totally decidable problem
totally decidable problem
A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. The associated language is called a decidable language.
- Partie du discours : noun
- Secteur d’activité/Domaine : Informatique
- Catégorie : Algorithms & data structures
- Government Agency: NIST
0
Créateur
- GeorgeV
- 100% positive feedback