Problem 1 (35 points). L is a language over the alphabet Σ. Prove L = {(M) | M is a TM, L(M) is finite} is NOT Turing de
Posted: Fri Jul 08, 2022 7:27 am
by answerhappygod
1 (20.53 KiB) Viewed 26 times
Problem 1 (35 points). L is a language over the alphabet Σ. Prove L = {(M) | M is a TM, L(M) is finite} is NOT Turing decidable. (Hint: 0 is a finite language, Σ* is an infinite language)