Answer Happy

Posted: **Wed Mar 30, 2022 9:28 am**

: Consider The Following Language Lb M At Some Point During Its Computation On Empty Input E M Writes The Symbol B O 1 (10.04 KiB) Viewed 42 times

Consider the following language LB = {(M) at some point during its computation on empty input e, M writes the symbol B on its tape} Show that Lg is undecidable. Hint: use a reduction from Atm to LB.