>  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.

0 0

작성자

  • GeorgeV
  •  (Gold) 1123 포인트
  • 100% positive feedback
© 2024 CSOFT International, Ltd.