Answer Happy • 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 dec

Page 1 of 1

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 dec

Posted: Tue Jul 05, 2022 10:26 am

by answerhappygod

: 1 (15.85 KiB) Viewed 15 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: is a finite language, Σ* is an infinite language)