Home > Term: recursively solvable
recursively solvable
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.
- Part of Speech: noun
- Industry/Domain: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Creator
- GeorgeV
- 100% positive feedback