- 07/23/2019 at 2:53 pm #1505734EduGorillaKeymaster
Consider a problem Z, in it-
“Suppose there is a Turing Machine L over the input alphabet ∑ any state of L and a word s € ∑, does the computation of L on s visit the state q?
Choose the correct statement about Z?
Post your Training /Course EnquiryAre You looking institutes / coaching center for
- Z is partially decidable
- Z is decidable
- Z is undecidable
- Z is undecidable but partially decidable
- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad