Reducability and decidability language

50 Views Asked by At

i am new to this course called Theory of Computation. And my teacher asked to solve this ... i dont know how to do it... please help

Consider the langauge L_inf : A turing machine M belongs to L_inf if L(M) is an infinite set. Is this language turing recognizable?