74) If there exists a language L, for which there exists a TM, T, that accepts every word in L and either rejects or loops for every word that is not in L, is called
Answer is:
recursively enumerable
Related Theory of Computation MCQ with Answers
Answer is:
all of these
Explanation:
Universal TM influenced the concept of
* stored program computers
* interpretative implementation of programming language
* computability