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
Which of the following statements are undecidable?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following statements are undecidable?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!