Whats a decidable language?
Score: 4.1/5 (45 votes) (definition) 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 ...