(adj) :
(Of a formal language) Incapable of being algorithmically decided in finite time. A set of strings is
undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included