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

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.

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}

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.

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

A is some decidable language. Select all statements that are true irrespective of what A is.1 pointHALTS ≤ HALTS'HALTS' ≤ HALTSA ≤ HALTS'HALTS' ≤ A