Home > 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.
- Del af tale: noun
- Branche/domæne: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Ophavsmand
- GeorgeV
- 100% positive feedback