Consider the following language:
INF TM = {M | L(M) is infinite}
where M is the encoding of a Turing Machine, proves that INF TM is undecidable.
Consider the following language:
INF TM = {M | L(M) is infinite}
where M is the encoding of a Turing Machine, proves that INF TM is undecidable.