A recursive (decidable) language is defined as a language for which there exists an algorithm deciding if a string is or not in the language that terminates for every possible input. The question is, does there exist a programming language/grammar/something that is able to represent all and only the algorithms that are a decider? I.e. all the possible programs that terminate, and not others?
Decidable languages
formal languages