I have a homework question that is as follows:
L(P) is a language of ASCII input strings for which a given program, P, returns "yes". Is the set of all input strings P decidable, such that P is a decision program and L(P) is decidable?
My intuition leads me to believe that the set is, in fact, decidable but I am having a tough time proving my answer.
Would appreciate any help on this. Thanks