Page 1 of 1

Which of the following statements are undecidable?

Posted: Thu Jul 14, 2022 9:26 am
by answerhappygod
For a given Turing Machine M,
a) does M halt on an empty input tape
b) does M halt for anly inputs at all?
c) is L(M) regular? Context free? Turing decidable?
d) all of the mentioned