(definition)
Definition: 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.
Also known as totally decidable problem, algorithmically solvable, recursively solvable.
See also undecidable problem, NP, NP-complete, solvable, tractable, computable.
Note: For emphasis, the equivalent term totally decidable problem is sometimes used.
From Algorithms and Theory of Computation Handbook, pages 24-19 and 26-20, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:27:57 2004.
HTML page formatted Wed Oct 26 09:47:24 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "decidable problem", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/decidableProblem.html
