NIST

algorithmically solvable

(definition)

Definition: See decidable problem.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

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:09 2005.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "algorithmically solvable", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/algorithmicallySolvable.html

to NIST home page