Definition: A language for which membership can be decided by an algorithm that halts on all inputs in a finite number of steps --- equivalently, can be recognized by a Turing machine that halts for all inputs.
Also known as recursive language, totally decidable language.
See also undecidable language, decidable problem, recursively enumerable language.
Note: For emphasis, the equivalent term totally decidable language is sometimes used. From Algorithms and Theory of Computation Handbook, page 24-19, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 9 August 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "decidable language", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 9 August 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/decidableLanguage.html