Decidable
A language is decidable if some TM accepts every string in that language, and rejects every string not in the language in finite time.
- Such a TM is called a decider. Notice all deciders halt eventually on every input
-
L = { Ok | k = 2n for some n } is decidable
What about the language HALT ?
Or Hilbert’s 10th problem ?