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.
- Μέρος του λόγου: noun
 - Κλάδος/Τομέας: Υπολογιστές
 - Category: Αλγόριθμοι & δομές
 - Government Agency: NIST
 
 			0   			 		
 Δημιουργός
- GeorgeV
 - 100% positive feedback