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.undecidablenone of the mentionedTuring acceptabledecidable

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.

The Halting Problem is proven to be undecidable using a technique introduced by:a.Stephen Cookb.Noam Chomskyc.Alan Turingd.Kurt Gödel

Define unrecognisable and undecidable languages.

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

Select all true statements1 pointThere is a TM that loops on all inputsLet A be any decidable language. There is a TM that loops on exactly the strings not in A.Let A be any decidable language. There is a TM that loops on exactly the strings in A.There is an undecidable language A such that there is a TM that halts on exactly the strings in A.There is an undecidable language A such that the complement of A is decidable.There is a decidable language A such that the complement of A is undecidable.