Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which of the following is/are undecidable?a)G...
Start Learning for Free
Which of the following is/are undecidable?
- a)Given a TM M, decide is M accepts are strings.
- b)Given a TM, M decide is M takes more than 1073 steps on every string.
- c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .
- d)Given a TM M, decide is L(M) is regular.
Correct answer is option 'A,C,D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Which of the following is/are undecidable?a)Given a TM M, decide is M ...
For a given TM, M decide that m takes more than 1073 steps on every string is decidabe only.
Remaining are undecidable (A), (C) and (D) are undecidable.
Remaining are undecidable (A), (C) and (D) are undecidable.
Free Test
FREE
| Start Free Test |
Community Answer
Which of the following is/are undecidable?a)Given a TM M, decide is M ...
Undecidable Problems
In theoretical computer science, there are certain problems that cannot be solved by any algorithm or Turing machine. These problems are known as undecidable problems. They are fundamental limitations in the field of computation and have significant implications for the theory of computation.
Explanation of Options
Let's go through each option to understand why it is undecidable:
Option A: Given a TM M, decide if M accepts all strings.
This problem is undecidable because it is equivalent to the Halting Problem, which states that there is no algorithm that can determine whether a given Turing machine halts on a given input. If we could decide whether a Turing machine accepts all strings, we could use that decision procedure to solve the Halting Problem, which is proven to be undecidable.
Option B: Given a TM M, decide if M takes more than 1073 steps on every string.
This problem is decidable because we can simulate the execution of the Turing machine on all possible inputs up to 1073 steps. If the Turing machine halts within this limit on any input, we can decide that it does not take more than 1073 steps on every string. Therefore, this option is not undecidable.
Option C: Given two Turing machines M1 and M2, decide if L(M1) = L(M2).
This problem is undecidable because it is equivalent to the problem of determining whether two Turing machines accept the same language. This problem is known as the equivalence problem for Turing machines and is proven to be undecidable.
Option D: Given a TM M, decide if L(M) is regular.
This problem is undecidable because it is equivalent to the problem of determining whether a given language is regular. This problem, known as the regularity problem, is proven to be undecidable.
Conclusion
In summary, options A, C, and D are undecidable problems. Option B is decidable, as it can be solved by simulating the Turing machine execution on all possible inputs up to a given step limit. The undecidability of these problems has significant implications for the limitations of computation and the theory of computation.
In theoretical computer science, there are certain problems that cannot be solved by any algorithm or Turing machine. These problems are known as undecidable problems. They are fundamental limitations in the field of computation and have significant implications for the theory of computation.
Explanation of Options
Let's go through each option to understand why it is undecidable:
Option A: Given a TM M, decide if M accepts all strings.
This problem is undecidable because it is equivalent to the Halting Problem, which states that there is no algorithm that can determine whether a given Turing machine halts on a given input. If we could decide whether a Turing machine accepts all strings, we could use that decision procedure to solve the Halting Problem, which is proven to be undecidable.
Option B: Given a TM M, decide if M takes more than 1073 steps on every string.
This problem is decidable because we can simulate the execution of the Turing machine on all possible inputs up to 1073 steps. If the Turing machine halts within this limit on any input, we can decide that it does not take more than 1073 steps on every string. Therefore, this option is not undecidable.
Option C: Given two Turing machines M1 and M2, decide if L(M1) = L(M2).
This problem is undecidable because it is equivalent to the problem of determining whether two Turing machines accept the same language. This problem is known as the equivalence problem for Turing machines and is proven to be undecidable.
Option D: Given a TM M, decide if L(M) is regular.
This problem is undecidable because it is equivalent to the problem of determining whether a given language is regular. This problem, known as the regularity problem, is proven to be undecidable.
Conclusion
In summary, options A, C, and D are undecidable problems. Option B is decidable, as it can be solved by simulating the Turing machine execution on all possible inputs up to a given step limit. The undecidability of these problems has significant implications for the limitations of computation and the theory of computation.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer?
Question Description
Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer?.
Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer?.
Solutions for Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer?, a detailed solution for Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? has been provided alongside types of Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which of the following is/are undecidable?a)Given a TM M, decide is M accepts are strings.b)Given a TM, M decide is M takes more than 1073 steps on every string.c)Given two turing machines M1 and M2 decide of L(M1) = L(M2) .d)Given a TM M, decide is L(M) is regular.Correct answer is option 'A,C,D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup