الصفحة الرئيسية > 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.
- قسم من أقسام الكلام: noun
- المجال / النطاق: علم الكمبيوتر
- الفئة: Algorithms & data structures
- Government Agency: NIST
0
المنشئ
- GeorgeV
- 100% positive feedback