This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 2 months ago.

  • Author
    Posts
  • #1505734 Reply
     EduGorilla 
    Keymaster

    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?

    Options :-

    1. Z is partially decidable
    2. Z is decidable
    3. Z is undecidable
    4. Z is undecidable but partially decidable
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Consider a problem Z, in it- “Suppose there is a Turing Machine L over the input alphabet ∑ any ….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account