The concept of "decidability" in the context of languages refers to:a.The ability to generate strings in a language.b.The ability to recognize a language efficiently.c.The existence of an algorithm that determines membership in a language.d.The ability to simulate any Turing machine.

When can we say that the language is decidable or undecidable?

A language L is said to be ____________ if there is a Turing machine M such that L(M)=L and M halts at every point. ans. decidable Turing acceptable none of the mentioned undecidable

Define unrecognisable and undecidable languages.

Select all languages that are known to be decidable.1 point{x}, where x is some specific string{}{x#y#xy | x and y are strings over {a, b}}HALTS = {(M, x) | M halts on input x}{x: x = aba and Goldbach conjecture is True}

problems of decidability and undecidability in tabular form