홈 > 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
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
- 100% positive feedback