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.
+1 (231)-518-0303 [email protected]
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.