if there exists a language , for which there exists a tm, , that accepts every word in and either rejects or loops for every word that is not in , this language is called