Decidable languages are languages such that the problem of whether a given word belongs to it or not is decidable. A decision problem, i.e., a question with a yes/no answer, is called decidable if there exists an algorithm (a Turing machine) that can and will return a Boolean true or false value (instead of looping indefinitely).
Questions tagged [decidable]
92 questions
-1
votes
1 answer
Recursively Decidable language, acceptance of infinite language
So it is my understanding that Recursively Decidable languages are the languages that we can build a Turing Machine such that given an input w from that language, Turing Machine will always either accept and halt or reject and halt. What I am…
Saik
- 993
- 1
- 16
- 40
-1
votes
1 answer
Why decider D behaves the opposite when it is using decider H as a subroutine?
Acoordind to paragraph shown, how decider D uses H as a subroutine and how it is behaving the opposite ?
It would be very useful if someone clarify this ?
Garrick
- 677
- 4
- 15
- 34